Abstract
AbstractWe 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.
Publisher
Springer Nature Switzerland
Reference20 articles.
1. Aguilera, J.P., Baaz, M.: Unsound inferences make proofs shorter. J. Symb. Logic 84(1), 102–122 (2019)
2. Avron, A.: The method of hypersequents in the proof theory of propositional non-classical logics. In: Hodges, W. (ed.) Logic: Foundations to Applications, pp. 1–32 (1996)
3. Bednarska, K., Indrzejczak, A.: Hypersequent calculi for S5: the methods of cut elimination. Logic Log. Philos. 24, 08 (2015)
4. Belnap, N.D.: Display logic. J. Philos. Logic 375–417 (1982)
5. Blackburn, P., van Benthem, J., Wolter, F.: Handbook of Modal Logic. Elsevier (2006)