4 found
  1.  35
    Effective algebraicity.Rebecca M. Steiner - 2013 - Archive for Mathematical Logic 52 (1-2):91-112.
    Results of R. Miller in 2009 proved several theorems about algebraic fields and computable categoricity. Also in 2009, A. Frolov, I. Kalimullin, and R. Miller proved some results about the degree spectrum of an algebraic field when viewed as a subfield of its algebraic closure. Here, we show that the same computable categoricity results also hold for finite-branching trees under the predecessor function and for connected, finite-valence, pointed graphs, and we show that the degree spectrum results do not hold for (...)
    Direct download (3 more)  
    Export citation  
    Bookmark   2 citations  
  2.  12
    Classifications of Computable Structures.Karen Lange, Russell Miller & Rebecca M. Steiner - 2018 - Notre Dame Journal of Formal Logic 59 (1):35-59.
    Let K be a family of structures, closed under isomorphism, in a fixed computable language. We consider effective lists of structures from K such that every structure in K is isomorphic to exactly one structure on the list. Such a list is called a computable classification of K, up to isomorphism. Using the technique of Friedberg enumeration, we show that there is a computable classification of the family of computable algebraic fields and that with a 0'-oracle, we can obtain similar (...)
    Direct download (4 more)  
    Export citation  
  3.  13
    Computable fields and the bounded Turing reduction.Rebecca M. Steiner - 2012 - Annals of Pure and Applied Logic 163 (6):730-742.
  4.  31
    Low n Boolean subalgebras.Rebecca M. Steiner - 2012 - In S. Barry Cooper (ed.), How the World Computes. pp. 696--702.
    Direct download  
    Export citation