A Proof System for Finite Trees

In this paper we introduce a description language for finite trees. Although we briefly note some of its intended applications, the main goal of the paper is to provide it with a sound and complete proof system.We do so using standard axioms from modal provability logic and modal logics of programs, and prove completeness by extending techniques due to Van Benthem and Meyer-Viol [2] and Blackburn and Meyer-Viol [5]. We conclude with a proof of the EXPTIME-completeness of the satisfiability problem, and a discussion of issues related to complexity and theorem proving.

[1]  Marcus Kracht,et al.  Mathematical Aspects of Command Relations , 1993, EACL.

[2]  Claire Gardent,et al.  Talking About Trees , 1993, EACL.

[3]  Marcus Kracht.  Syntactic codes and grammar refinement , 1995 .

[4]  Vaughan R. Pratt,et al.  Models of program logics , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[5]  Patrick Blackburn,et al.  Linguistics, Logic and Finite Trees , 1993, Log. J. IGPL.

[6]  B. Courcelle.  Fundamental properties of infinite trees , 1983 .

[7]  Claire Gardent,et al.  A Specification Language for Lexical Functional Grammars , 1995, EACL.

[8]  James Rogers,et al.  Studies in the logic of trees with applications to grammar formalisms , 1994 .

[9]  G. Boolos,et al.  Self-Reference and Modal Logic , 1985 .

[10]  M. Rabin.  Decidability of second-order theories and automata on infinite trees. , 1969 .

[11]  Richard E. Ladner,et al.  Propositional Dynamic Logic of Regular Programs , 1979, J. Comput. Syst. Sci..

[12]  Thomas Berlage,et al.  A selective undo mechanism for graphical user interfaces based on command objects , 1994, TCHI.

[13]  Michael J. Maher.  Complete axiomatizations of the algebras of finite, rational and infinite trees , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[14]  C. Pollard,et al.  Center for the Study of Language and Information , 2022 .

[15]  Rolf Backofen,et al.  A first-order axiomatization of the theory of finite trees , 1995, J. Log. Lang. Inf..

[16]  M. Rabin.  Decidability of second-order theories and automata on infinite trees , 1968 .

[17]  Marcus Kracht.  Syntactic codes and grammar refinement , 1995, J. Log. Lang. Inf..