Twist Sequent Calculi for S4 and its Neighbors
Open Access
- 31 December 2024
- journal article
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 415, 16-32
Abstract
Two Gentzen-style twist sequent calculi for the normal modal logic S4 are introduced and investigated. The proposed calculi, which do not employ the standard logical inference rules for the negation connective, are characterized by several twist logical inference rules for negated logical connectives. Using these calculi, short proofs can be generated for provable negated modal formulas that contain numerous negation connectives. The cut-elimination theorems for the calculi are proved, and the subformula properties for the calculi are also obtained. Additionally, Gentzen-style twist (hyper)sequent calculi for other normal modal logics including S5 are considered.Keywords
All Related Versions
This publication has 28 references indexed in Scilit:
- Embracing Background Knowledge in the Analysis of Actual Causality: An Answer Set Programming ApproachTheory and Practice of Logic Programming, 2023
- Falsification-Aware Calculi and Semantics for Normal Modal Logics Including S4 and S5Journal of Logic, Language and Information, 2022
- Two Is Enough – Bisequent Calculus for S5Lecture Notes in Computer Science, 2019
- Evaluating epistemic negation in answer set programmingArtificial Intelligence, 2016
- Hypersequent Calculi for Modal Logics Extending S42014
- 2 Modal proof theory2007
- Logic programming and knowledge representationThe Journal of Logic Programming, 1994
- Uniform proofs as a foundation for logic programmingAnnals of Pure and Applied Logic, 1991
- Application of modal logic to programmingStudia Logica, 1980
- Semantical Analysis of Modal Logic I Normal Modal Propositional CalculiMathematical Logic Quarterly, 1963