All arithmetical sets of powers of primes are first-order definable in terms of the successor function and the coprimeness predicate

DOI10.1016/0012-365X(85)90144-XzbMath0562.03006MaRDI QIDQ2266708

Denis Richard

Publication date: 1985

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

codingfirst-order definabilityfirst-order arithmeticisomorphic reinterpretation

Mathematics Subject Classification ID

Classical first-order logic (03B10) Decidability of theories and sets of sentences (03B25)

Related Items (6)

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

• Unnamed Item
• An Infinite Product for e
• Definability and decision problems in arithmetic

This page was built for publication: All arithmetical sets of powers of primes are first-order definable in terms of the successor function and the coprimeness predicate