IJCAR 2016: Automated Reasoning pp 416-432

# Inducing Syntactic Cut-Elimination for Indexed Nested Sequents

• Revantha Ramanayake
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9706)

## Abstract

The key to the proof-theoretical study of a logic is a cutfree proof calculus. Unfortunately there are many logics of interest lacking suitable proof calculi. The proof formalism of nested sequents was recently generalised to indexed nested sequents in order to yield cutfree proof calculi for extensions of the modal logic K by Geach (Lemmon-Scott) axioms. The proofs of completeness and cut-elimination therein were semantical and intricate. Here we identify a subclass of the labelled sequent formalism and show that it corresponds to the indexed nested sequent formalism. This correspondence is then exploited to induce syntactic proofs for indexed nested sequents using the elegant existing proofs in the labelled sequent formalism. A larger goal of this work is to demonstrate how specialising existing proof-theoretical transformations (adapting these as required to remain within the subclass) is an alternative proof method which can alleviate the need for independent proofs from ‘scratch’ in each formalism. Moreover, such coercion can be used to induce new cutfree calculi. We demonstrate by presenting the first indexed nested sequent calculi for intermediate logics.

## Keywords

Proof theory Cut-elimination Nested labelled sequents Modal logic

## References

1. 1.
Blackburn, P., de Rijke, M., Venema, Y.: Modal Logic. Cambridge Tracts in Theoretical Computer Science, vol. 53. Cambridge University Press, Cambridge (2001)
2. 2.
Brünnler, K.: Deep sequent systems for modal logic. In: Advances in modal logic, vol. 6, pp. 107–119. Coll. Publ., London (2006)Google Scholar
3. 3.
Dyckhoff, R., Negri, S.: Proof analysis in intermediate logics. Arch. Math. Log. 51(1–2), 71–92 (2012)
4. 4.
Dyckhoff, R., Negri, S.: Geometrization of first-order logic. Bull. Symbolic Logic 21, 123–163 (2015)
5. 5.
Fitting, M.: Cut-free proof systems for Geach logics. IfCoLog J. Logics Appl. 2, 17–64 (2015)Google Scholar
6. 6.
Fitting, M.: Proof Methods for Modal and Intuitionistic Logics, Synthese Library, vol. 169. D. Reidel Publishing Co., Dordrecht (1983)
7. 7.
Fitting, M.: Prefixed tableaus and nested sequents. Ann. Pure Appl. Logic 163(3), 291–313 (2012)
8. 8.
Fitting, M.: Nested sequents for intuitionistic logics. Notre Dame J. Formal Logic 55(1), 41–61 (2014)
9. 9.
Gentzen, G.: The collected papers of Gerhard Gentzen. In: Szabo, M.E. (ed.) Studies in Logic and the Foundations of Mathematics. North-Holland Publishing Co., Amsterdam (1969)Google Scholar
10. 10.
Goré, R., Postniece, L., Tiu, A.: On the correspondence between display postulates and deep inference in nested sequent calculi for tense logics. Log. Methods Comput. Sci. 7(2), 2:8–3:8 (2011)
11. 11.
Goré, R., Ramanayake, R.: Labelled tree sequents, tree hypersequents and nested (deep) sequents. In: Advances in modal logic, vol. 9. College Publications, London (2012)Google Scholar
12. 12.
Kashima, R.: Cut-free sequent calculi for some tense logics. Stud. Logica. 53(1), 119–135 (1994)
13. 13.
Marin, S., Straßburger, L.: Label-free modular systems for classical and intuitionistic modal logics. In: Advances in Modal Logic 10, Invited and Contributed papers from the Tenth Conference on “Advances in Modal Logic," held in Groningen, The Netherlands, 5–8 August 2014, pp. 387–406 (2014)Google Scholar
14. 14.
Mints, G.: Indexed systems of sequents and cut-elimination. J. Philos. Logic 26(6), 671–696 (1997)
15. 15.
Negri, S.: Proof analysis in modal logic. J. Philos. Logic 34(5–6), 507–544 (2005)
16. 16.
Olivetti, N., Pozzato, G.L.: Nested sequent calculi and theorem proving for normal conditional logics: the theorem prover NESCOND. Intelligenza Artificiale 9(2), 109–125 (2015)
17. 17.
Poggiolesi, F.: A purely syntactic and cut-free sequent calculus for the modal logic of provability. Rev. Symbolic Logic 2(4), 593–611 (2009)
18. 18.
Restall, G.: Comparing modal sequent systems. http://consequently.org/papers/comparingmodal.pdf
19. 19.
Straßburger, L.: Cut elimination in nested sequents for intuitionistic modal logics. In: Pfenning, F. (ed.) FOSSACS 2013 (ETAPS 2013). LNCS, vol. 7794, pp. 209–224. Springer, Heidelberg (2013)