Undecidability of satisfiability of expansions of FO [ < ] over words with a FO [ + ]-definable set
From MaRDI portal
Publication:4601030
DOI10.3233/COM-170069zbMath1420.03103MaRDI QIDQ4601030
Publication date: 18 January 2018
Published in: Computability (Search for Journal in Brave)
Undecidability and degrees of sets of sentences (03D35) Automata and formal grammars in connection with logical questions (03D05) Classical first-order logic (03B10)
Related Items (1)
This page was built for publication: Undecidability of satisfiability of expansions of FO [ < ] over words with a FO [ + ]-definable set