Hintikka multiplicities in matrix decision methods for some propositional modal logics
From MaRDI portal
Publication:4610320
DOI10.1007/BFb0027410zbMath1415.03035OpenAlexW1560904997MaRDI QIDQ4610320
Serenella Cerrito, Marta Cialdea Mayer
Publication date: 15 January 2019
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bfb0027410
Modal logic (including the logic of norms) (03B45) Decidability of theories and sets of sentences (03B25) Mechanization of proofs and logical operations (03B35)
Related Items (1)
Cites Work
- Proof methods for modal and intuitionistic logics
- First-order modal tableaux
- A uniform procedure for converting matrix proofs into sequent-style systems
- A Polynomial Translation of S4 into T and Contraction-Free Tableaux for S4
- The Computational Complexity of Provability in Systems of Modal Propositional Logic
- Efficient loop-check for backward proof search in some non-classical propositional logics
- Strongly analytic tableaux for normal modal logics
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Hintikka multiplicities in matrix decision methods for some propositional modal logics