Undecidability of satisfiability of expansions of FO[<] over words with a FO[+]-definable set

Milchior, A

Milchior, A (reprint author), Univ Paris 07, IRIF, Denis Diderot, France.

COMPUTABILITY-THE JOURNAL OF THE ASSOCIATION CIE, 2017; 6 (4): 333

Abstract

Two new characterizations of FO[&lt;, mod]-definable sets, i.e. sets of integers definable in first-order logic with the order relation and modular re......

Full Text Link