Weak Presentations of Computable Fields

Journal of Symbolic Logic 60 (1):199 - 208 (1995)
It is shown that for any computable field K and any r.e. degree a there is an r.e. set A of degree a and a field F ≅ K with underlying set A such that the field operations of F (including subtraction and division) are extendible to (total) recursive functions. Further, it is shown that if a and b are r.e. degrees with b ≤ a, there is a 1-1 recursive function $f: \mathbb{Q} \rightarrow \omega$ such that f(Q) ∈ a, f(Z) ∈ b, and the images of the field operations of Q under f can be extended to recursive functions
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2275517
 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
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 22,720
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA
Alexandra Shlapentokh (1996). Rational Separability Over a Global Field. Annals of Pure and Applied Logic 79 (1):93-108.

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

199 ( #17,474 of 1,937,259 )

Recent downloads (6 months)

15 ( #33,800 of 1,937,259 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.