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

<a class="pub-badge pub-badge--doi" href="https://doi.org/10.1007/3-540-61377-3_46" rel="nofollow">DOI 10.1007/3-540-61377-3_46</a><a class="pub-badge pub-badge--grey" href="https://zbmath.org/1540.03044" rel="nofollow">zbMATH</a><a class="pub-badge pub-badge--mardi" href="https://portal.mardi4nfdi.de/wiki/Item:Q6560176" rel="nofollow">MaRDI QID Q6560176</a><a class="pub-badge pub-badge--grey" href="https://fdo.portal.mardi4nfdi.de/fdo/Q6560176" rel="nofollow">FDO</a>

Authors Jörg Hudelmaier

Publication date 21 June 2024

Mathematics Subject Classification ID

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

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

Cites work

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

Cited in

(2)

• Efficient local reductions to basic modal logic
• 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)