Improved decision procedures for the modal logics K, T and S4

DOI10.1007/3-540-61377-3_46zbMATH Open1540.03044MaRDI QIDQ6560176FDOQ6560176

Authors: Jörg Hudelmaier 

Publication date: 21 June 2024

Recommendations

• scientific article; zbMATH DE number 1418348
• scientific article; zbMATH DE number 970622
• A loop-free decision procedure for modal propositional logics K4, S4 and S5
• scientific article; zbMATH DE number 1735878
• Sequent calculi and decision procedures for weak modal systems

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Mechanization of proofs and logical operations (03B35)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Proof methods for modal and intuitionistic logics
• The Computational Complexity of Provability in Systems of Modal Propositional Logic
• The effect of bounding the number of primitive propositions and the depth of nesting on the complexity of modal logic
• The computational complexity of the satisfiability of modal Horn clauses for modal propositional logics
• An O(n log n)-Space Decision Procedure for Intuitionistic Propositional Logic
• A tableau-like proof procedure for normal modal logics

Cited In (1)

• On the modal logic K plus theories

This page was built for publication: Improved decision procedures for the modal logics K, T and S4

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