A Cut-Free and Invariant-Free Sequent Calculus for PLTL
- 24 August 2007
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 481-495
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Investigation of finitary calculus for a discrete linear time logic by means of infinitary calculus2005
- Gentzen-Systems for propositional temporal logics2005
- Theorem-Proving for Discrete Temporal Logic2005
- Structural Cut EliminationInformation and Computation, 2000
- Propositional temporal logics: decidability and completenessLogic Journal of the IGPL, 2000
- The complexity of propositional linear temporal logicsJournal of the ACM, 1985
- Temporal logic can be more expressiveInformation and Control, 1983
- On the temporal analysis of fairness1980