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

07/02/2019
by   Rajeev Goré, et al.
0

We give a linear nested sequent calculus for the basic normal tense logic 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 KB.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

10/15/2019

Syntactic Cut-Elimination for Intuitionistic Fuzzy Logic via Linear Nested Sequents

This paper employs the recently introduced linear nested sequent framewo...
04/23/2020

Proof Theory of Riesz Spaces and Modal Riesz Spaces

We design hypersequent calculus proof systems for the theories of Riesz ...
01/07/2020

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

Extending and generalizing the approach of 2-sequents (Masini, 1992), we...
03/13/2015

Non-normal modalities in variants of Linear Logic

This article presents modal versions of resource-conscious logics. We co...
02/23/2021

Syntactic completeness of proper display calculi

A recent strand of research in structural proof theory aims at exploring...
10/17/2018

Fast Cut-Elimination using Proof Terms: An Empirical Study

Urban and Bierman introduced a calculus of proof terms for the sequent c...
12/30/2021

A Deep Inference System for Differential Linear Logic

Differential linear logic (DiLL) provides a fine analysis of resource co...
This week in AI

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