A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
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.doi:10.1007/978-3-642-15025-8_5 fatcat:64n7ds34xzgnvmn5mcfb5rhjja