2000 character limit reached
Decidable Expansions of Labelled Linear Orderings
Published 10 Feb 2011 in cs.LO and math.LO | (1102.2232v2)
Abstract: Consider a linear ordering equipped with a finite sequence of monadic predicates. If the ordering contains an interval of order type \omega or -\omega, and the monadic second-order theory of the combined structure is decidable, there exists a non-trivial expansion by a further monadic predicate that is still decidable.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.