Abstract
We show that under Dickson's conjecture about the distribution of primes in the natural numbers, the theory Th (+, 1, 0, Pr) where Pr is a predicate for the prime numbers and their negations is decidable, unstable, and supersimple. This is in contrast with Th (+, 0, Pr, <) which is known to be undecidable by the works of Jockusch, Bateman, and Woods.
Original language | English |
---|---|
Pages (from-to) | 1041-1050 |
Number of pages | 10 |
Journal | Journal of Symbolic Logic |
Volume | 82 |
Issue number | 3 |
DOIs | |
State | Published - 1 Sep 2017 |
Bibliographical note
Funding Information:§4. Acknowledgements. The first author would like to thank the Israel Science foundation for partial support of this research (Grant no. 1533/14). The research leading to these results has received funding from the European Research Council, ERC Grant Agreement n. 338821. No. 1082 on the second author’s list of publications.
Publisher Copyright:
Copyright © The Association for Symbolic Logic 2017.
Keywords
- Dickson's conjecture
- decidability
- model theory
- primes