Refutations, proofs, and models in the modal logic K4

DOI10.1023/A:1015174332202zbMath0998.03017OpenAlexW1601411689MaRDI QIDQ1604792

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

zbMATH Keywords

possible worlds semanticsdecidabilityprovability logicS4modal logic K4syntactic decision procedureGrzegorczyk's logicrefutation rules

Mathematics Subject Classification ID

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)

Related Items (6)

Refutation-aware Gentzen-style calculi for propositional until-free linear-time temporal logic ⋮ Finite tree-countermodels via refutation systems in extensions of positive logic with strong negation ⋮ On refutation rules ⋮ Falsification-aware calculi and semantics for normal modal logics including S4 and S5 ⋮ Maximality and refutability ⋮ Intuitionistic Socratic procedures

This page was built for publication: Refutations, proofs, and models in the modal logic K4