Pages that link to "Item:Q1062669"
From MaRDI portal
The following pages link to The decision problem for linear temporal logic (Q1062669):
Displaying 27 items.
- No future without (\textit{a hint of}) past. A finite basis for `almost future' temporal logic (Q259068) (← links)
- Metric temporal logic revisited (Q266865) (← links)
- Undecidability of partial order logics (Q294640) (← links)
- Temporal logics over linear time domains are in PSPACE (Q418122) (← links)
- The complexity of temporal logic over the reals (Q636345) (← links)
- Decidability in elementary analysis. II (Q912081) (← links)
- New proof of the solvability of the elementary theory of linearly ordered sets (Q923067) (← links)
- Decidable metric logics (Q999264) (← links)
- An axiomatization for until and since over the reals without the IRR rule (Q1207338) (← links)
- The complexity of the temporal logic with ``until'' over general linear time (Q1400578) (← links)
- Decidable fragments of first-order temporal logics (Q1591203) (← links)
- Timer formulas and decidable metric temporal logic (Q1780454) (← links)
- Combining temporal logic systems (Q1815427) (← links)
- Decidability in elementary analysis. I (Q1823233) (← links)
- Event-based time-stamped claim logic (Q2043818) (← links)
- Synthesis for continuous time (Q2355696) (← links)
- Complexity of monodic guarded fragments over linear and real time (Q2576942) (← links)
- Metric temporal reasoning with less than two clocks (Q2901203) (← links)
- (Q3757893) (← links)
- On the decidability of continuous time specification formalisms (Q4221299) (← links)
- (Q4247687) (← links)
- Decidability of Scott's model as an ordered ℚ-vectorspace (Q4372914) (← links)
- (Q4417914) (← links)
- (Q4636296) (← links)
- The Expressive Power of Temporal and First-Order Metric Logics (Q5049053) (← links)
- European Summer Meeting of the Association for Symbolic Logic (Q5966661) (← links)
- Non-emptiness test for automata over words indexed by the reals and rationals (Q6666789) (← links)