A context-free linear ordering with an undecidable first-order theory

Arnaud Carayol, Zoltán Ésik

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationTheoretical Computer Science - 7th IFIP TC 1/WG 2.2 International Conference, TCS 2012, Proceedings
Pages104-118
Number of pages15
DOIs
Publication statusPublished - 2012
Event7th IFIP International Conference on Theoretical Computer Science, TCS 2012 - Amsterdam, Netherlands
Duration: Sep 26 2012Sep 28 2012

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7604 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other7th IFIP International Conference on Theoretical Computer Science, TCS 2012
CountryNetherlands
CityAmsterdam
Period9/26/129/28/12

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'A context-free linear ordering with an undecidable first-order theory'. Together they form a unique fingerprint.

  • Cite this

    Carayol, A., & Ésik, Z. (2012). A context-free linear ordering with an undecidable first-order theory. In Theoretical Computer Science - 7th IFIP TC 1/WG 2.2 International Conference, TCS 2012, Proceedings (pp. 104-118). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7604 LNCS). https://doi.org/10.1007/978-3-642-33475-7_8