Some Analytic Systems of Rules
Author:
Open Access
- 14 September 2023
- book chapter
- Published by Springer Nature
- p. 94-111
Abstract
We define two simple systems of rules, i.e. calculi with a global condition on the order of rule instances in a proof, for the modal logics of shift-reflexive and Euclidean frames respectively. Cut-elimination, and therefore the subformula property, can be derived directly from the cut-elimination property of adjacent logics. We compare our system to the calculus of grafted hypersequents, which has previously been used to capture both logics.We then discuss an attempt to obtain similar ‘modular’ cut-elimination proofs in other systems of rules. This general attempt is carried out for two more logics, namely the modal logic of serial frames and the intermediate logic axiomatised by the law of the weak excluded middle.Keywords
This publication has 18 references indexed in Scilit:
- Generic Modal Cut Elimination Applied to Conditional LogicsLogical Methods in Computer Science, 2011
- Deep sequent systems for modal logicArchive for Mathematical Logic, 2009
- Proofnets for S5: Sequents and circuits for modal logic2007
- 2 Modal proof theory2007
- Modal Logic2006
- Proof Analysis in Modal LogicJournal of Philosophical Logic, 2005
- Strongly analytic tableaux for normal modal logics1994
- A cut-free gentzen-type system for the logic of the weak law of excluded middleStudia Logica, 1986
- Pseudo two-valued evaluation method for intermediate logicsStudia Logica, 1986
- Display logicJournal of Philosophical Logic, 1982