Incompleteness of first-order temporal logic with until
From MaRDI portal
Publication:1123184
DOI10.1016/0304-3975(88)90045-XzbMath0677.03013OpenAlexW2092497338MaRDI QIDQ1123184
Leszek Holenderski, Andrzej Szałas
Publication date: 1988
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(88)90045-x
Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Abstract data types; algebraic specification (68Q65)
Related Items
Concerning the semantic consequence relation in first-order temporal logic ⋮ Completeness of a first-order temporal logic with time-gaps ⋮ Decidability and incompleteness results for first-order temporal logics of linear time ⋮ Undecidability of QLTL and QCTL with two variables and one monadic predicate letter ⋮ Arithmetical axiomatization of first-order temporal logic ⋮ Parameterized verification of leader/follower systems via first-order temporal logic ⋮ A complete axiomatic characterization of first-order temporal logic of linear time ⋮ On temporal logics with data variable quantifications: decidability and complexity ⋮ Specification of abstract dynamic-data types: A temporal logic approach ⋮ Undecidable Propositional Bimodal Logics and One-Variable First-Order Linear Temporal Logics with Counting ⋮ A decidability result for the model checking of infinite-state systems ⋮ On the interpretability of arithmetic in temporal logic ⋮ A decision procedure and complete axiomatization for projection temporal logic ⋮ Mechanising first-order temporal resolution ⋮ On strictly arithmetical completeness in logics of programs ⋮ Axioms for real-time logics ⋮ Similarity saturation for first order linear temporal logic with UNLESS ⋮ Decidable fragments of first-order temporal logics
Cites Work
This page was built for publication: Incompleteness of first-order temporal logic with until
