The paper establishes syntactic correspondences between non-wellfounded and cyclic proofs for LTL in linear nested sequents by proving completeness relative to saturation recurrence and introducing an unraveling shift procedure.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Non-Wellfounded and Cyclic Proofs for LTL: A Syntactic Correspondence with Linear Nested Sequents
The paper establishes syntactic correspondences between non-wellfounded and cyclic proofs for LTL in linear nested sequents by proving completeness relative to saturation recurrence and introducing an unraveling shift procedure.