Decidability and Undecidability of Theories with a Predicate for the Primes
Bateman, P. T. ; Jockusch, C. G. ; Woods, A. R.
J. Symbolic Logic, Tome 58 (1993) no. 1, p. 672-687 / Harvested from Project Euclid
It is shown, assuming the linear case of Schinzel's Hypothesis, that the first-order theory of the structure $\langle \omega; +, P\rangle$, where $P$ is the set of primes, is undecidable and, in fact, that multiplication of natural numbers is first-order definable in this structure. In the other direction, it is shown, from the same hypothesis, that the monadic second-order theory of $\langle\omega; S, P\rangle$ is decidable, where $S$ is the successor function. The latter result is proved using a general result of A. L. Semenov on decidability of monadic theories, and a proof of Semenov's result is presented.
Publié le : 1993-06-14
Classification: 
@article{1183744255,
     author = {Bateman, P. T. and Jockusch, C. G. and Woods, A. R.},
     title = {Decidability and Undecidability of Theories with a Predicate for the Primes},
     journal = {J. Symbolic Logic},
     volume = {58},
     number = {1},
     year = {1993},
     pages = { 672-687},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183744255}
}
Bateman, P. T.; Jockusch, C. G.; Woods, A. R. Decidability and Undecidability of Theories with a Predicate for the Primes. J. Symbolic Logic, Tome 58 (1993) no. 1, pp.  672-687. http://gdmltest.u-ga.fr/item/1183744255/