Incompleteness of first-order temporal logic with until

DOI10.1016/0304-3975(88)90045-XMaRDI QIDQ1123184zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

incompletenesshalting problemfirst-order temporal logictemporal modalities

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Abstract data types; algebraic specification (68Q65)

Recommendations

• scientific article; zbMATH DE number 3968560
• Decidability and incompleteness results for first-order temporal logics of linear time
• On the strength of temporal proofs
• Temporal logics need their clocks
• scientific article; zbMATH DE number 3972843
• scientific article; zbMATH DE number 1678387
• Decidable fragments of first-order temporal logics
• scientific article; zbMATH DE number 4053579
• Concerning the semantic consequence relation in first-order temporal logic
• Axiomatising first-order temporal logic: Until and since over linear time

Cites work

• scientific article; zbMATH DE number 3885853 (Why is no real title available?)
• A generalized nexttime operator in temporal logic
• Concerning the semantic consequence relation in first-order temporal logic

Cited in

(27)

• Completeness of a first-order temporal logic with time-gaps
• On temporal logics with data variable quantifications: decidability and complexity
• A decidability result for the model checking of infinite-state systems
• Decidable fragments of first-order temporal logics
• Incompleteness in linear time
• Concerning the semantic consequence relation in first-order temporal logic
• Decidability and incompleteness results for first-order temporal logics of linear time
• Undecidable propositional bimodal logics and one-variable first-order linear temporal logics with counting
• Kripke incompleteness of first-order calculi with temporal modalities of CTL and near logics
• A complete axiomatic characterization of first-order temporal logic of linear time
• Mechanising first-order temporal resolution
• Trakhtenbrot theorem and first-order axiomatic extensions of MTL
• On the interpretability of arithmetic in temporal logic
• Equality and monodic first-order temporal logic
• Arithmetical axiomatization of first-order temporal logic
• A decision procedure and complete axiomatization for projection temporal logic
• Expressive completeness failure in branching time structures
• Undecidability of QLTL and QCTL with two variables and one monadic predicate letter
• Axioms for real-time logics
• scientific article; zbMATH DE number 3858393 (Why is no real title available?)
• The power of temporal proofs
• Specification of abstract dynamic-data types: A temporal logic approach
• Parameterized verification of leader/follower systems via first-order temporal logic
• Incompleteness of a first-order Gödel logic and some temporal logics of programs
• On strictly arithmetical completeness in logics of programs
• Similarity saturation for first order linear temporal logic with UNLESS
• scientific article; zbMATH DE number 4053579 (Why is no real title available?)

This page was built for publication: Incompleteness of first-order temporal logic with until

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