DECISION PROBLEM FOR LINEAR ORDERINGS IN STATIONARY LOGICS
Heinrich Herre · 2005
Let TLO(aa) be a theory of linear orderings in the stationary logic L(aa). It is well-known that TLO(aa) is undecidable [Se 82]. On the other hand the decision problem for the theory TDLO(aa) of the class of finitely determinate linear orderings in L(aa) remains open. The following results contribute to a solution of this problem. A linear ordering (A,<) is said to be ω1-dense iff for all a, b ∈ A, a < b: