A Context-Free Linear Ordering with an Undecidable First-Order Theory
From MaRDI portal
Publication:2915164
DOI10.1007/978-3-642-33475-7_8zbMath1318.68102OpenAlexW1878756200MaRDI QIDQ2915164
Publication date: 21 September 2012
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-33475-7_8
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25)
Related Items