Weak Presentations of Computable Fields

Journal of Symbolic Logic 60 (1):199 - 208 (1995)
  Copy   BIBTEX

Abstract

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

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 76,140

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2009-01-28

Downloads
210 (#60,708)

6 months
1 (#447,993)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

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

References found in this work

No references found.

Add more references