Syntactic cut-elimination and backward proof-search for tense logic via linear nested sequents

DOI10.1007/978-3-030-29026-9_11zbMath1435.03084arXiv1907.01270OpenAlexW2969582419MaRDI QIDQ2180517

Rajeev Goré, Björn Lellmann

Publication date: 14 May 2020

Full work available at URL: https://arxiv.org/abs/1907.01270

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Cut-elimination and normal-form theorems (03F05) Temporal logic (03B44)

Related Items (2)

A formally verified cut-elimination procedure for linear nested sequents for tense logic ⋮ CUT-FREE COMPLETENESS FOR MODULAR HYPERSEQUENT CALCULI FOR MODAL LOGICS K, T, AND D

This page was built for publication: Syntactic cut-elimination and backward proof-search for tense logic via linear nested sequents