Analytic Proofs for Tense Logic
Open Access
- 25 September 2025
- book chapter
- Published by Springer Nature
- p. 220-237
Abstract
The first algorithm to transform a proof in Nishimura’s sequent calculus $$\textbf{GKt}$$ for tense logic $$\textbf{Kt}$$ into an analytic proof of the same sequent is presented. In an analytic proof, every rule instance is analytic i.e., each formula in every premise is a subformula of some formula in its conclusion. We call this algorithm analytic restriction to convey that it extends analytic cut-restriction where just the cut-rule instances are made analytic. This distinction is essential in tense logic since cut and modal rules can both cause non-analyticity. Analytic cut-restriction is itself an extension of cut-elimination so our work contributes to a broader program of transforming arbitrary sequent proofs into ones constructed from a designated set of formulas—not necessarily subformulas. As with cut-elimination, the aim is to limit the proof search space and support proof-theoretic and meta-logical investigations.
Keywords
This publication has 25 references indexed in Scilit:
- BOUNDED-ANALYTIC SEQUENT CALCULI AND EMBEDDINGS FOR HYPERSEQUENT LOGICSThe Journal of Symbolic Logic, 2021
- Proof Analysis in Modal LogicJournal of Philosophical Logic, 2005
- Modal Logic2001
- Labelled Non-Classical Logics2000
- Displaying Modal Logic1998
- Power and Weakness of the Modal Display Calculus1996
- A Syntactic Proof of Cut‐Elimination For GLlinMathematical Logic Quarterly, 1986
- The modal logic of provability: Cut-eliminationJournal of Philosophical Logic, 1983
- Display logicJournal of Philosophical Logic, 1982
- Subformula results in some propositional modal logicsStudia Logica, 1978