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

Journal of Symbolic Logic 54 (4):1253-1287 (1989)
Using coding devices based on a theorem due to Zsigmondy, Birkhoff and Vandiver, we first define in terms of successor S and coprimeness predicate $\perp$ a full arithmetic over the set of powers of some fixed prime, then we define in the same terms a restriction of the exponentiation. Hence we prove the main result insuring that all arithmetical relations and functions over prime powers and their opposite are $\{S, \perp\}$ -definable over Z. Applications to definability over Z and N are stated as corollaries of the main theorem
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2274815
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history
Request removal from index
Download options
Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 28,840
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

10 ( #435,820 of 2,178,269 )

Recent downloads (6 months)

1 ( #316,623 of 2,178,269 )

How can I increase my downloads?

My notes
Sign in to use this feature

There  are no threads in this forum
Nothing in this forum yet.

Other forums