Abstract
We give a linear nested sequent calculus for the basic normal tense logic \(\mathsf {Kt}\). We show that the calculus enables backwards proof-search, counter-model construction and syntactic cut-elimination. Linear nested sequents thus provide the minimal amount of nesting necessary to provide an adequate proof-theory for modal logics containing converse. As a bonus, this yields a cut-free calculus for symmetric modal logic \(\mathsf {KB}\).
Supported by WWTF project MA16-28.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Bonnette, N., Goré, R.: A labelled sequent system for tense logic \(\text{K}_{\text{t}}\). In: Antoniou, G., Slaney, J. (eds.) AI 1998. LNCS, vol. 1502, pp. 71–82. Springer, Heidelberg (1998). https://doi.org/10.1007/BFb0095042
Brünnler, K.: Deep sequent systems for modal logic. Arch. Math. Log. 48, 551–577 (2009)
Dershowitz, N., Manna, Z.: Proving termination with multiset orderings. Commun. ACM 22(8), 465–476 (1979)
Goré, R.: Tableau methods for modal and temporal logics. In: D’Agostino, M., Gabbay, D.M., Hähnle, R., Posegga, J. (eds.) Handbook of Tableau Methods. Kluwer, Dordrecht (1999)
Goré, R., Lellmann, B.: Syntactic cut-elimination and backward proof-search for tense logic via linear nested sequents (extended version). CoRR abs/1907.01270 (2019). http://arxiv.org/abs/1907.01270
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) (2011). https://doi.org/10.2168/LMCS-7(2:8)2011
Goré, R., Widmann, F.: Sound global state caching for ALC with inverse roles. In: Giese, M., Waaler, A. (eds.) TABLEAUX 2009. LNCS (LNAI), vol. 5607, pp. 205–219. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-02716-1_16
Horrocks, I., Sattler, U., Tobies, S.: Reasoning with individuals for the description logic \(\cal{SHIQ}\). In: McAllester, D. (ed.) CADE 2000. LNCS (LNAI), vol. 1831, pp. 482–496. Springer, Heidelberg (2000). https://doi.org/10.1007/10721959_39
Indrzejczak, A.: Linear time in hypersequent framework. Bull. Symb. Log. 22, 121–144 (2016)
Kashima, R.: Cut-free sequent calculi for some tense logics. Studia Logica 53(1), 119–136 (1994)
Kuznets, R., Lellmann, B.: Interpolation for intermediate logics via hyper- and linear nested sequents. In: Bezhanishvili, G., D’Agostino, G., Metcalfe, G., Studer, T. (eds.) Advances in Modal Logic 2018, pp. 473–492. College Publications (2018)
Lahav, O.: From frame properties to hypersequent rules in modal logics. In: 28th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2013, New Orleans, LA, USA, 25–28 June 2013, pp. 408–417 (2013). https://doi.org/10.1109/LICS.2013.47
Lellmann, B.: Linear nested sequents, 2-sequents and hypersequents. In: De Nivelle, H. (ed.) TABLEAUX 2015. LNCS (LNAI), vol. 9323, pp. 135–150. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-24312-2_10
Lellmann, B., Pimentel, E.: Modularisation of sequent calculi for normal and non-normal modalities. ACM Trans. Comput. Logic 20(2), 7:1–7:46 (2019)
Masini, A.: 2-sequent calculus: a proof theory of modalities. Ann. Pure Appl. Logic 58, 229–246 (1992)
Ohnishi, M., Matsumoto, K.: Gentzen method in modal calculi I. Osaka Math. J. 9, 113–130 (1957)
Parisi, A.: Second-order modal logic. Ph.D. thesis, University of Connecticut (2017)
Poggiolesi, F.: Gentzen Calculi for Modal Propositional Logic. Trends in Logic, vol. 32. Springer, Heidelberg (2010). https://doi.org/10.1007/978-90-481-9670-8
Trzesicki, K.: Gentzen-style axiomatization of tense logic. Bull. Sect. Log. 13(2), 75–83 (1984)
Wansing, H.: Sequent calculi for normal modal proposisional logics. J. Log. Comput. 4(2), 125–142 (1994)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Goré, R., Lellmann, B. (2019). Syntactic Cut-Elimination and Backward Proof-Search for Tense Logic via Linear Nested Sequents. In: Cerrito, S., Popescu, A. (eds) Automated Reasoning with Analytic Tableaux and Related Methods. TABLEAUX 2019. Lecture Notes in Computer Science(), vol 11714. Springer, Cham. https://doi.org/10.1007/978-3-030-29026-9_11
Download citation
DOI: https://doi.org/10.1007/978-3-030-29026-9_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-29025-2
Online ISBN: 978-3-030-29026-9
eBook Packages: Computer ScienceComputer Science (R0)