On the elementary theory of linear order

No author found.

Related Items (26)

Ehrenfeucht-Fraïssé games on ordinals ⋮ A verified decision procedure for orders in Isabelle/HOL ⋮ The expressive power of Malitz quantifiers for linear orderings ⋮ Algorithmic uses of the Feferman-Vaught theorem ⋮ Euclidean algorithm for a class of linear orders ⋮ The Boolean algebra of the theory of linear orders ⋮ The complexity of the temporal logic with ``until over general linear time ⋮ Stationary Logic and Ordinals ⋮ Temporal logics over linear time domains are in PSPACE ⋮ Deciding Equations in the Time Warp Algebra ⋮ Universal first-order quantification over automata ⋮ On frontiers of regular trees ⋮ The complexity of temporal logic over the reals ⋮ Time warps, from algebra to algorithms ⋮ New proof of the solvability of the elementary theory of linearly ordered sets ⋮ A Feferman-Vaught Decomposition Theorem for Weighted MSO Logic. ⋮ On quantifier-rank equivalence between linear orders ⋮ On Expressive Power of Regular Expressions over Infinite Orders ⋮ Theories of linear order ⋮ Decision methods for linearly ordered Heyting algebras ⋮ The complete finitely axiomatized theories of order are dense ⋮ AN ALGEBRAIC APPROACH TO MSO-DEFINABILITY ON COUNTABLE LINEAR ORDERINGS ⋮ On the theory of convex subsets ⋮ Decidable fragments of first-order temporal logics ⋮ Complexity of monodic guarded fragments over linear and real time ⋮ Synthesis for continuous time

This page was built for publication: On the elementary theory of linear order