Answer to a problem raised by J. Robinson: The arithmetic of positive or negative integers is definable from successor and divisibility

DOI10.2307/2273981zbMath0612.03009OpenAlexW2076691615MaRDI QIDQ3752366

Denis Richard

Publication date: 1985

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2273981

zbMATH Keywords

divisibilitysuccessor functionarbitrary integers

Mathematics Subject Classification ID

Decidability (number-theoretic aspects) (11U05) Decidability of theories and sets of sentences (03B25)

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 ⋮ INTERPRETING ARITHMETIC IN THE FIRST-ORDER THEORY OF ADDITION AND COPRIMALITY OF POLYNOMIAL RINGS ⋮ Definability, decidability, complexity ⋮ Unnamed Item

Cites Work

• Definability and decision problems in arithmetic
• Unnamed Item

This page was built for publication: Answer to a problem raised by J. Robinson: The arithmetic of positive or negative integers is definable from successor and divisibility