A journey in modal proof theory: From minimal normal modal logic to discrete linear temporal logic

by   Simone Martini, et al.

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.



page 1

page 2

page 3

page 4


Syntactic cut-elimination and backward proof-search for tense logic via linear nested sequents (Extended version)

We give a linear nested sequent calculus for the basic normal tense logi...

Non-normal modalities in variants of Linear Logic

This article presents modal versions of resource-conscious logics. We co...

Hypersequent calculi for non-normal modal and deontic logics: Countermodels and optimal complexity

We present some hypersequent calculi for all systems of the classical cu...

From 2-sequents and Linear Nested Sequents to Natural Deduction for Normal Modal Logics

We extend to natural deduction the approach of Linear Nested Sequents an...

A general proof certification framework for modal logic

One of the main issues in proof certification is that different theorem ...

Ecumenical modal logic

The discussion about how to put together Gentzen's systems for classical...

Access-based Intuitionistic Knowledge

We introduce the concept of access-based intuitionistic knowledge which ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.