A context-free linear ordering with an undecidable first-order theory
Abstract
The words of a context-free language, ordered by the lexicographic ordering, form a context-free linear ordering. It is well-known that the linear orderings associated with deterministic context-free languages have a decidable monadic second-order theory. In stark contrast, we give an example of a context-free language whose lexicographic ordering has an undecidable first-order theory.
| Origin | Files produced by the author(s) |
|---|
Loading...
