A loop-free decision procedure for modal propositional logics K4, S4 and S5

DOI10.1007/s10992-008-9089-zzbMath1174.03003OpenAlexW2034594774MaRDI QIDQ2271187

Dorota Leszczyńska-Jasion

Publication date: 6 August 2009

Published in: Journal of Philosophical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10992-008-9089-z

zbMATH Keywords

decision procedurelogic of questionsloop-free proceduresmethod of Socratic proofstransitive modal logics

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Philosophical and critical aspects of logic and foundations (03A05)

Related Items (6)

Socratic trees ⋮ Loop-free calculus for modal logic S4. I ⋮ Loop-free calculus for modal logic S4. II ⋮ An axiomatic account of question evocation: the propositional case ⋮ Answering by Means of Questions in View of Inferential Erotetic Logic ⋮ The method of Socratic proofs for modal propositional logics: K5, S4.2, S4.3, S4F, S4R, S4M and G.

Uses Software

• Pesca

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Modal tableau calculi and interpolation
• Socratic proofs and paraconsistency: A case study
• The method of Socratic proofs for modal propositional logics: K5, S4.2, S4.3, S4F, S4R, S4M and G.
• Proof methods for modal and intuitionistic logics
• Socratic proofs
• Socratic proofs for quantifiers
• A description logic with transitive and inverse roles and role hierarchies
• Practical reasoning for very expressive description logics

This page was built for publication: A loop-free decision procedure for modal propositional logics K4, S4 and S5