Switch to: References

Add citations

You must login to add citations.
  1. 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 (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Rational separability over a global field.Alexandra Shlapentokh - 1996 - Annals of Pure and Applied Logic 79 (1):93-108.
    Let F be a finitely generated field and let j : F → N be a weak presentation of F, i.e. an isomorphism from F onto a field whose universe is a subset of N and such that all the field operations are extendible to total recursive functions. Then if R1 and R2 are recursive subrings of F, for all weak presentations j of F, j is Turing reducible to j if and only if there exists a finite collection of (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations