Switch to: References

Add citations

You must login to add citations.
  1. Generalized weak presentations.Alexandra Shlapentokh - 2002 - Journal of Symbolic Logic 67 (2):787-819.
    Let K be a computable field. Let F be a collection of recursive functions over K, possibly including field operations. We investigate the following question. Given an r.e. degree a, is there an injective map j: K $\longrightarrow \mathbb{N}$ such that j(K) is of degree a and all the functions in F are translated by restrictions of total recursive functions.
    Download  
     
    Export citation  
     
    Bookmark  
  • Weak presentations of non-finitely generated fields.Alexandra Shlapentokh - 1998 - Annals of Pure and Applied Logic 94 (1-3):223-252.
    Let K be a countable field. Then a weak presentation of K is an isomorphism of K onto a field whose elements are natural numbers, such that all the field operations are extendible to total recursive functions. Given a pair of two non-finitely generated countable fields contained in some overfield, we investigate under what circumstances the overfield has a weak presentation under which the given fields have images of arbitrary Turing degrees or, in other words, we investigate Turing separability of (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation