Pages that link to "Item:Q5536269"
From MaRDI portal
The following pages link to On the elementary theory of linear order (Q5536269):
Displaying 25 items.
- Temporal logics over linear time domains are in PSPACE (Q418122) (← links)
- Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
- The complexity of temporal logic over the reals (Q636345) (← links)
- New proof of the solvability of the elementary theory of linearly ordered sets (Q923067) (← links)
- On quantifier-rank equivalence between linear orders (Q964492) (← links)
- The expressive power of Malitz quantifiers for linear orderings (Q1105586) (← links)
- The Boolean algebra of the theory of linear orders (Q1141142) (← links)
- Theories of linear order (Q1216299) (← links)
- The complete finitely axiomatized theories of order are dense (Q1231486) (← links)
- The complexity of the temporal logic with ``until'' over general linear time (Q1400578) (← links)
- Decidable fragments of first-order temporal logics (Q1591203) (← links)
- A verified decision procedure for orders in Isabelle/HOL (Q2147186) (← links)
- Synthesis for continuous time (Q2355696) (← links)
- Decision methods for linearly ordered Heyting algebras (Q2491077) (← links)
- On the theory of convex subsets (Q2558218) (← links)
- Complexity of monodic guarded fragments over linear and real time (Q2576942) (← links)
- Ehrenfeucht-Fraïssé games on ordinals (Q2636521) (← links)
- Time warps, from algebra to algorithms (Q2695363) (← links)
- On frontiers of regular trees (Q3780462) (← links)
- Stationary Logic and Ordinals (Q3929721) (← links)
- AN ALGEBRAIC APPROACH TO MSO-DEFINABILITY ON COUNTABLE LINEAR ORDERINGS (Q4692085) (← links)
- A Feferman-Vaught Decomposition Theorem for Weighted MSO Logic. (Q5005180) (← links)
- On Expressive Power of Regular Expressions over Infinite Orders (Q5740199) (← links)
- Euclidean algorithm for a class of linear orders (Q6056733) (← links)
- Deciding Equations in the Time Warp Algebra (Q6151556) (← links)
