A Cut-Free and Invariant-Free Sequent Calculus for PLTL
From MaRDI portal
Publication:3608433
DOI10.1007/978-3-540-74915-8_36zbMATH Open1179.03056OpenAlexW1871326816MaRDI QIDQ3608433FDOQ3608433
Authors: J. Gaintzarain, M. Hermo, P. Lucio, Marisa Navarro, Fernando Orejas 
Publication date: 5 March 2009
Published in: Computer Science Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-74915-8_36
Recommendations
- Cut, invariant rule, and loop-check free sequent calculus for PLTL
- Finite sequent calculi for PLTL
- Cut-elimination and a permutation-free sequent calculus for intuitionistic logic
- A contraction-free and cut-free sequent calculus for propositional dynamic logic
- Sequent systems for PLTL
- A Cut-Free Sequent Calculus for Bi-intuitionistic Logic
- A cut-free sequent calculus for pure type systems verifying the structural rules of Gentzen/Kleene
- A cut-free sequent calculus for the logic of constant domains with a limited amount of duplications
- Contraction-free sequent calculi for intuitionistic logic
- PTL sequent calculus system
Cited In (12)
- Sequent systems for PLTL
- Loop-type sequent calculi for temporal logic
- One-Pass Tableaux for Computation Tree Logic
- Cut, invariant rule, and loop-check free sequent calculus for PLTL
- Finite sequent calculi for PLTL
- Cut-free sequent systems for temporal logic
- More efficient proof-search for sequents of temporal logic
- On the proof theory of the modal mu-calculus
- A derivation-loop method for temporal logic
- Invariant-free clausal temporal resolution
- Refutation-aware Gentzen-style calculi for propositional until-free linear-time temporal logic
- Dual systems of tableaux and sequents for PLTL
Uses Software
This page was built for publication: A Cut-Free and Invariant-Free Sequent Calculus for PLTL
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608433)
