The following pages link to The power of temporal proofs (Q1118578):
Displaying 20 items.
- A decidability result for the model checking of infinite-state systems (Q438572) (← links)
- Peano arithmetic as axiomatization of the time frame in logics of programs and in dynamic logics (Q687278) (← links)
- On the strength of temporal proofs (Q809066) (← links)
- Programming in metric temporal logic (Q1128978) (← links)
- Temporal logics need their clocks (Q1186428) (← links)
- The power of the ``always'' operator in first-order temporal logic (Q1350527) (← links)
- Multi-dimensional logic programming: theoretical foundations (Q1390957) (← links)
- Specification of abstract dynamic-data types: A temporal logic approach (Q1391733) (← links)
- Decidability of infinite-state timed CCP processes and first-order LTL (Q1763732) (← links)
- A propositional probabilistic logic with discrete linear time for reasoning about evidence (Q1928821) (← links)
- Temporal prophecy for proving temporal properties of infinite-state systems (Q2058382) (← links)
- A survey on temporal logics for specifying and verifying real-time systems (Q2418645) (← links)
- LTL over integer periodicity constraints (Q2503321) (← links)
- Theorem proving using clausal resolution: from past to present (Q2695485) (← links)
- Linear-time temporal logics with Presburger constraints: an overview ★ (Q3647243) (← links)
- Decidability and incompleteness results for first-order temporal logics of linear time (Q4275689) (← links)
- Temporal abductive reasoning about biochemical reactions (Q4586234) (← links)
- Foundations of linear-time logic programming (Q4876388) (← 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)
