A linear nested sequent calculus for Kt is presented that admits syntactic cut-elimination, backward proof-search, and counter-model construction while using minimal nesting for converse modalities.
In: Automated Reasoning with Analytic Tableaux and Related Met hods, 18th Interna- tional Conference, TABLEAUX 2009, Oslo, Norway, July 6-10, 2009
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Syntactic cut-elimination and backward proof-search for tense logic via linear nested sequents (Extended version)
A linear nested sequent calculus for Kt is presented that admits syntactic cut-elimination, backward proof-search, and counter-model construction while using minimal nesting for converse modalities.