A proof system for finite trees

DOI10.1007/3-540-61377-3_33zbMATH Open1540.03061MaRDI QIDQ6560163FDOQ6560163

Wilfried Meyer-Viol, Maarten de Rijke, Patrick Blackburn

Publication date: 21 June 2024

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Modal logic (including the logic of norms) (03B45) Decidability of theories and sets of sentences (03B25) Logic in computer science (03B70)

Cites Work

• Propositional dynamic logic of regular programs
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Fundamental properties of infinite trees
• Self-reference and modal logic
• Syntactic codes and grammar refinement
• Linguistics, Logic and Finite Trees
• A first-order axiomatization of the theory of finite trees

This page was built for publication: A proof system for finite trees

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