Michael J. Maher. Complete axiomatisations of the algebra of finite, rational and infinite trees. In Third Anual Symposium on Logic in Computer Science, pages 348-- 357, IEEE, Edinburgh, Scotland, july 1988. Home/Search Document Not in Database Context Related Articles Check |
This paper is cited by the following papers:
First Order Data Types and First Order Logic - Treinen (1991) (Correct)
Records for Logic Programming - Smolka, Treinen (1994) (80 citations) (Correct)
A Proof System for Finite Trees - Blackburn, Meyer-Viol, de Rijke (1995) (4 citations) (Correct)
First Order Data Types and First Order Logic - Treinen (1991) (Correct)
A New Method for Undecidability Proofs of First Order Theories - Treinen (1992) (21 citations) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC