A proof system for finite trees

DOI10.1007/3-540-61377-3_33MaRDI QIDQ6560163zbMATH OpenFDO

Authors Patrick Blackburn, Wilfried Meyer-Viol, Maarten de Rijke

Publication date 21 June 2024

Full work available at URL https://doi.org/10.1007/3-540-61377-3_33

Mathematics Subject Classification ID

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

Recommendations

• Linguistics, Logic and Finite Trees
• A sequent calculus for a modal logic on finite data trees
• A first-order axiomatization of the theory of finite trees
• scientific article; zbMATH DE number 1163388
• An Easy Completeness Proof for the Modal μ-Calculus on Finite Trees

Cites work

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

Cited in

(1)

• A complete propositional dynamic logic for regular expressions with lookahead

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)