Author:
KAPLAN ITAY,SHELAH SAHARON
Abstract
AbstractWe 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.
Publisher
Cambridge University Press (CUP)
Reference19 articles.
1. Dp-Minimality: Basic Facts and Examples
2. [15] Simon P. , On dp-minimal ordered structures , this Journal, vol. 76 (2011), no. 2, pp. 448–460.
3. A survey of arithmetical definability;Bès;Bulletin of The Belgian Mathematical Society-Simon Stevin,2001
4. A list of arithmetical structures complete with respect to the first-order definability
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献