Definability in terms of the successor function and the coprimeness predicate in the set of arbitrary integers
From MaRDI portal
Publication:3478404
DOI10.2307/2274815zbMath0701.03030MaRDI QIDQ3478404
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
definability; coding; coprimeness predicate; full arithmetic over the set of powers of some fixed prime
Related Items
Defining integer-valued functions in rings of continuous definable functions over a topological field, INTERPRETING ARITHMETIC IN THE FIRST-ORDER THEORY OF ADDITION AND COPRIMALITY OF POLYNOMIAL RINGS, A list of arithmetical structures complete with respect to the first-order definability, Definability, decidability, complexity, On arithmetical first-order theories allowing encoding and decoding of lists