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
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 42,236
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

Rational Separability Over a Global Field.Alexandra Shlapentokh - 1996 - Annals of Pure and Applied Logic 79 (1):93-108.
Weak Presentations of Non-Finitely Generated Fields.Alexandra Shlapentokh - 1998 - Annals of Pure and Applied Logic 94 (1-3):223-252.

Add more citations

Similar books and articles


Added to PP index

Total views
207 ( #32,548 of 2,254,259 )

Recent downloads (6 months)
2 ( #782,717 of 2,254,259 )

How can I increase my downloads?


My notes

Sign in to use this feature