On the bounded theories of finite trees

DOI10.1007/BFB0027788zbMATH Open1541.03111MaRDI QIDQ6560360FDOQ6560360

Authors: Sergei Vorobyov 

Publication date: 21 June 2024

Recommendations

• An improved lower bound for the elementary theories of trees
• Theory of finite or infinite trees revisited
• On the computational complexity of the theory of complete binary trees
• First-order theories of bounded trees
• A first-order axiomatization of the theory of finite trees

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Basic properties of first-order languages and structures (03C07)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The polynomial-time hierarchy
• An application of games to the completeness problem for formalized theories
• The computational complexity of logical theories
• Negation in logic programming
• An improved lower bound for the elementary theories of trees
• Feature-constraint logics for unification grammars
• A feature constraint system for logic programming with entailment

This page was built for publication: On the bounded theories of finite trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6560360)