Decidability for Priorean Linear Time Using a Fixed-Point Labelled Calculus
Authors:
- 1 January 2009
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 108-122
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Cut-free sequent systems for temporal logicThe Journal of Logic and Algebraic Programming, 2008
- Proof analysis in non-classical logics2007
- Complete Sequent Calculi for Induction and Infinite Descent2007
- Proof Analysis in Modal LogicJournal of Philosophical Logic, 2005
- Propositional temporal logics: decidability and completenessLogic Journal of the IGPL, 2000
- A New One-Pass Tableau Calculus for PLTL1998
- A tableau system for linear-TIME temporal logic1997
- Reasoning about Infinite ComputationsInformation and Computation, 1994
- A decision algorithm for full propositional temporal logicLecture Notes in Computer Science, 1993
- The complexity of propositional linear temporal logicsJournal of the ACM, 1985