Definability in terms of the successor function and the coprimeness predicate in the set of arbitrary integers

DOI10.2307/2274815zbMath0701.03030OpenAlexW4250360846MaRDI QIDQ3478404

Denis Richard

Publication date: 1989

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

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

zbMATH Keywords

definabilitycodingcoprimeness predicatefull arithmetic over the set of powers of some fixed prime

Mathematics Subject Classification ID

Decidability (number-theoretic aspects) (11U05) First-order arithmetic and fragments (03F30)

Related Items (5)

On arithmetical first-order theories allowing encoding and decoding of lists ⋮ 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 ⋮ Defining integer-valued functions in rings of continuous definable functions over a topological field

This page was built for publication: Definability in terms of the successor function and the coprimeness predicate in the set of arbitrary integers