Decidable Expansions of Labelled Linear Orderings

Let M = (A, <, P) where (A, <) is a linear ordering and P denotes a finite sequence of monadic predicates on A. We show that if A contains an interval of order type or -, and the monadic second-order theory of M is decidable, then there exists a non-trivial expansion M of M by a monadic predicate such that the monadic second-order theory of M is still decidable.

• Type: Conference
• Year: 2010
• Where: BIRTHDAY
• Authors: Alexis Bès, Alexander Rabinovich
• Keywords: Applied Computing, BIRTHDAY 2010, Finite Sequence, Monadic Second-order Theory, Order Type