A first-order axiomatization of the theory of finite trees

DOI10.1007/BF01048403zbMath0833.03010MaRDI QIDQ1903080

Yanyan Li

Publication date: 5 December 1995

Published in: Journal of Logic, Language and Information (Search for Journal in Brave)

zbMATH Keywords

first-order theoriesfinite treesaxiomatizationsEhrenfeucht-Fraïssé gamesnatural language syntaxlanguage complexity classes

Mathematics Subject Classification ID

Logic of natural languages (03B65)

Related Items

2009 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '09 ⋮ Axiomatizing the logical core of XPath 2.0 ⋮ Complete Axiomatizations of MSO, FO(TC 1 ) and FO(LFP 1 ) on Finite Trees ⋮ Temporal Logics with Reference Pointers and Computation Tree Logics ⋮ Determining the consistency of partial tree descriptions ⋮ APPROXIMATING TREES AS COLOURED LINEAR ORDERS AND COMPLETE AXIOMATISATIONS OF SOME CLASSES OF TREES ⋮ Dominance constraints with Boolean connectives: A model-eliminative treatment ⋮ First-order theories of bounded trees

Cites Work

• Unnamed Item
• Fundamental properties of infinite trees
• Mathematical methods in linguistics
• An axiom system for the weak monadic second order theory of two successors
• Monadic \(\Pi _ 1^ 1\)-theories of \(\Pi _ 1^ 1\)-properties
• Tree acceptors and some of their applications
• Linguistics, Logic and Finite Trees
• Decidability of Second-Order Theories and Automata on Infinite Trees

This page was built for publication: A first-order axiomatization of the theory of finite trees