Can I read Syntactic cut-elimination and backward proof-search for tense logic via linear nested sequents (Extended version) on EtoBox?

Syntactic cut-elimination and backward proof-search for tense logic via linear nested sequents (Extended version) by Goré, Rajeev; Lellmann, Björn is a scholarly article available to read on EtoBox.

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

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.

Author

Goré, Rajeev; Lellmann, Björn

Published

2019

Language

EN