Pages that link to "Item:Q1123184"
From MaRDI portal
The following pages link to Incompleteness of first-order temporal logic with until (Q1123184):
Displaying 18 items.
- On temporal logics with data variable quantifications: decidability and complexity (Q342712) (← links)
- A decidability result for the model checking of infinite-state systems (Q438572) (← links)
- On the interpretability of arithmetic in temporal logic (Q915718) (← links)
- Concerning the semantic consequence relation in first-order temporal logic (Q1090673) (← links)
- Arithmetical axiomatization of first-order temporal logic (Q1101100) (← links)
- A complete axiomatic characterization of first-order temporal logic of linear time (Q1102941) (← links)
- Completeness of a first-order temporal logic with time-gaps (Q1350524) (← links)
- Specification of abstract dynamic-data types: A temporal logic approach (Q1391733) (← links)
- Decidable fragments of first-order temporal logics (Q1591203) (← links)
- A decision procedure and complete axiomatization for projection temporal logic (Q1986563) (← links)
- Parameterized verification of leader/follower systems via first-order temporal logic (Q2149965) (← links)
- On strictly arithmetical completeness in logics of programs (Q2277248) (← links)
- Mechanising first-order temporal resolution (Q2486579) (← links)
- Undecidable Propositional Bimodal Logics and One-Variable First-Order Linear Temporal Logics with Counting (Q2957765) (← links)
- Decidability and incompleteness results for first-order temporal logics of linear time (Q4275689) (← links)
- Undecidability of QLTL and QCTL with two variables and one monadic predicate letter (Q5059700) (← links)
- Similarity saturation for first order linear temporal logic with UNLESS (Q5236443) (← links)
- Axioms for real-time logics (Q5958467) (← links)
