Refutations, proofs, and models in the modal logic K4
DOI10.1023/A:1015174332202zbMATH Open0998.03017OpenAlexW1601411689MaRDI QIDQ1604792FDOQ1604792
Authors: Tomasz Skura
Publication date: 8 July 2002
Published in: Studia Logica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1015174332202
Recommendations
decidabilityprovability logicpossible worlds semanticsS4modal logic K4syntactic decision procedureGrzegorczyk's logicrefutation rules
Modal logic (including the logic of norms) (03B45) Decidability of theories and sets of sentences (03B25) Provability logics and related algebras (e.g., diagonalizable algebras) (03F45)
Cited In (11)
- Finite tree-countermodels via refutation systems in extensions of positive logic with strong negation
- Maximality and refutability
- Falsification-aware calculi and semantics for normal modal logics including S4 and S5
- On refutation rules
- Rules of explosion and excluded middle: constructing a unified single-succedent Gentzen-style framework for classical, paradefinite, paraconsistent, and paracomplete logics
- Intuitionistic Socratic procedures
- Title not available (Why is that?)
- Title not available (Why is that?)
- Refutation-aware Gentzen-style calculi for propositional until-free linear-time temporal logic
- Refutation systems in modal logic
- Syntactic refutations against finite models in modal logic
This page was built for publication: Refutations, proofs, and models in the modal logic K4
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1604792)