A journey in modal proof theory: From minimal normal modal logic to discrete linear temporal logic
Logic in Computer Science
2020-01-08 v1
Abstract
Extending and generalizing the approach of 2-sequents (Masini, 1992), we present sequent calculi for the classical modal logics in the K, D, T, S4 spectrum. The systems are presented in a uniform way-different logics are obtained by tuning a single parameter, namely a constraint on the applicability of a rule. Cut-elimination is proved only once, since the proof goes through independently from the constraints giving rise to the different systems. A sequent calculus for the discrete linear temporal logic ltl is also given and proved complete. Leitmotiv of the paper is the formal analogy between modality and first-order quantification.
Keywords
Cite
@article{arxiv.2001.02029,
title = {A journey in modal proof theory: From minimal normal modal logic to discrete linear temporal logic},
author = {Simone Martini and Andrea Masini and Margherita Zorzi},
journal= {arXiv preprint arXiv:2001.02029},
year = {2020}
}
Comments
33 pages