All arithmetical sets of powers of primes are first-order definable in terms of the successor function and the coprimeness predicate
From MaRDI portal
Publication:2266708
DOI10.1016/0012-365X(85)90144-XzbMath0562.03006MaRDI QIDQ2266708
Publication date: 1985
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
Extensions of Hilbert's tenth problem, Definability and decidability issues in extensions of the integers with the divisibility predicate, A list of arithmetical structures complete with respect to the first-order definability, The Woods-Erdős conjecture for polynomial rings, Definability, decidability, complexity, Undecidable extensions of Skolem arithmetic
Cites Work