Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
435517 | Theoretical Computer Science | 2009 | 6 Pages |
Abstract
As is well known, a language of finite words, considered as labeled linear orders, is definable in monadic second-order logic (MSO) iff it is definable in the existential fragment of MSO, that is the quantifier alternation hierarchy collapses. Even more, it does not make a difference if we consider existential MSO over a linear order or a successor relation only. In this note we show that somewhat surprisingly the latter does not hold if we just add a second linear order and consider finite relational structures with two linear orders, so-called texts.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics