2017
DOI: 10.1017/jsl.2017.16
|View full text |Cite
|
Sign up to set email alerts
|

Decidability and Classification of the Theory of Integers With Primes

Abstract: We show that under Dickson's conjecture about the distribution of primes in the natural numbers, the theory T h (Z, +, 1, 0, P r) where P r is a predicate for the prime numbers and their negations is decidable, unstable and supersimple. This is in contrast with T h (Z, +, 0, P r, <) which is known to be undecidable by the works of Jockusch, Bateman and Woods.2010 Mathematics Subject Classification. 03C45, 03F30, 03B25, 11A41.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
13
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 11 publications
(13 citation statements)
references
References 16 publications
0
13
0
Order By: Relevance
“…We will next prove that Th(Z, SF Z ) is k-independent for all k > 0; see [5] for a definition of k-independence. The proof is almost the exact replica of the proof in [9] except the necessary modifications taken in the current paragraph. Suppose l > 0, and S is an arbitrary subset of {0, ... , l -1}.…”
Section: Lemma 33 If ϕ(X Z) Is a P-condition Then Modulo Either Sf *mentioning
confidence: 81%
See 1 more Smart Citation
“…We will next prove that Th(Z, SF Z ) is k-independent for all k > 0; see [5] for a definition of k-independence. The proof is almost the exact replica of the proof in [9] except the necessary modifications taken in the current paragraph. Suppose l > 0, and S is an arbitrary subset of {0, ... , l -1}.…”
Section: Lemma 33 If ϕ(X Z) Is a P-condition Then Modulo Either Sf *mentioning
confidence: 81%
“…Introduction. In [9], Kaplan and Shelah showed under the assumption of Dickson's conjecture that if Z is the additive group of integers implicitly assumed to contain 1 as a distinguished constant and a →a as a distinguished function, and if Pr is the set of a ∈ Z such that either a ora is prime, then the theory of (Z; Pr) is model complete, decidable, and super-simple of U-rank 1. From our current point of view, the above result can be seen as an example of a more general phenomenon where we can often capture aspects of randomness inside a structure using firstorder logic and deduce in consequence several model-theoretic properties of that structure.…”
mentioning
confidence: 99%
“…Concerning reducts of Presburger arithmetic, a recent result of the first author [6] is that there are no structures strictly between (Z, +, 0) and (Z, +, <, 0). In a different direction, Kaplan and Shelah [11] show that if P = {z ∈ Z : |z| is prime} then (Z, +, 0, P ) is unstable and, assuming a fairly strong conjecture in number theory, (Z, +, 0, P ) is supersimple of SU -rank 1 (see also Remark 1.8(3) below).…”
Section: Introduction and Summary Of Main Resultsmentioning
confidence: 99%
“…While the ring structure of the integers is model-theoretically extremely wild for being subject to the Gödel phenonemon, tame reducts of this structure with traces of multiplication, have been subject of various literature, see for example [2,4,5,6,7]. A classical result in this direction, is the tameness of the structure (Z, nZ, +, −, <), the so called Pressburger arithematic.…”
Section: Introductionmentioning
confidence: 99%