TY - GEN
T1 - Decidable expansions of labelled linear orderings
AU - Bès, Alexis
AU - Rabinovich, Alexander
PY - 2010
Y1 - 2010
N2 - Let M=(A,<P̄) where (A,<) is a linear ordering and 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.
AB - Let M=(A,<P̄) where (A,<) is a linear ordering and 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.
KW - decidability
KW - definability
KW - linear orderings
KW - monadic second-order logic
UR - http://www.scopus.com/inward/record.url?scp=77956570039&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-15025-8_5
DO - 10.1007/978-3-642-15025-8_5
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:77956570039
SN - 3642150241
SN - 9783642150241
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 95
EP - 107
BT - Fields of Logic and Computation - Essays Dedicated to Yuri Gurevich on the Occasion of His 70th Birthday
Y2 - 22 August 2010 through 22 August 2010
ER -