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

DOI10.1016/S0020-0190(99)00022-8zbMATH Open1338.03027OpenAlexW2042851559MaRDI QIDQ294659FDOQ294659

Authors: Pierre Yves Schobbens, Jean-François Raskin 

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

Recommendations

• The complexity of propositional linear temporal logics
• The complexity of the temporal logic with ``until over general linear time
• Completeness theorem for a first order linear-time logic
• scientific article; zbMATH DE number 17797
• Decidability and incompleteness results for first-order temporal logics of linear time

zbMATH Keywords

computational complexitytemporal logiccomplete axiomatizationautomatic theorem provingprogram specification

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• The complexity of propositional linear temporal logics
• A complete axiomatic characterization of first-order temporal logic of linear time
• The logic of ``initially and ``next: complete axiomatization and complexity
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (3)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q294659)