The logic of ``initially and ``next: complete axiomatization and complexity

DOI10.1016/S0020-0190(99)00022-8zbMath1338.03027OpenAlexW2042851559MaRDI QIDQ294659

Jean-François Raskin, Pierre-Yves Schobbens

Publication date: 16 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019099000228?np=y

zbMATH Keywords

computational complexityprogram specificationtemporal logiccomplete axiomatizationautomatic theorem proving

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Temporal logic (03B44)

Related Items (3)

The logic of ``initially and ``next: complete axiomatization and complexity ⋮ From LTL to unambiguous Büchi automata via disambiguation of alternating automata ⋮ The complexity of propositional linear temporal logics in simple cases

Cites Work

• The logic of ``initially and ``next: complete axiomatization and complexity
• A complete axiomatic characterization of first-order temporal logic of linear time
• The complexity of propositional linear temporal logics
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The logic of ``initially and ``next: complete axiomatization and complexity