Computer Science – Logic in Computer Science
Scientific paper
2011-02-10
LMCS 7 (2:5) 2011
Computer Science
Logic in Computer Science
18 pages
Scientific paper
10.2168/LMCS-7(2:5)2011
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.
Bès Alexis
Rabinovich Alexander
No associations
LandOfFree
Decidable Expansions of Labelled Linear Orderings does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Decidable Expansions of Labelled Linear Orderings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Decidable Expansions of Labelled Linear Orderings will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-631528