Pages that link to "Item:Q4275689"
From MaRDI portal
The following pages link to Decidability and incompleteness results for first-order temporal logics of linear time (Q4275689):
Displaying 13 items.
- A decidability result for the model checking of infinite-state systems (Q438572) (← links)
- On the axiomatizability of some first-order spatio-temporal theories (Q514577) (← links)
- Incompleteness of first-order temporal logic with until (Q1123184) (← links)
- Decidable fragments of first-order temporal logics (Q1591203) (← links)
- Proof theory for functional modal logic (Q1708100) (← links)
- Decidability of infinite-state timed CCP processes and first-order LTL (Q1763732) (← links)
- Saturated calculus for Horn-like sequents of a complete class of a linear temporal first order logic (Q1807462) (← links)
- A survey on temporal logics for specifying and verifying real-time systems (Q2418645) (← links)
- Mechanising first-order temporal resolution (Q2486579) (← links)
- Undecidable Propositional Bimodal Logics and One-Variable First-Order Linear Temporal Logics with Counting (Q2957765) (← links)
- The serializability problem for a temporal logic of transaction queries (Q3647287) (← links)
- A Branching Time Logical System for Open Distributed Systems Development (Q4916209) (← links)
- Incompleteness of a first-order Gödel logic and some temporal logics of programs (Q6560158) (← links)
