Search results for 'Jeanleah Mohrherr' (try it on Scholar)

  1. Jeanleah Mohrherr (1983). Kleene Index Sets and Functional M-Degrees. Journal of Symbolic Logic 48 (3):829-840.score: 120.0
    A many-one degree is functional if it contains the index set of some class of partial recursive functions but does not contain an index set of a class of r.e. sets. We give a natural embedding of the r.e. m-degrees into the functional degrees of 0'. There are many functional degrees in 0' in the sense that every partial-order can be embedded. By generalizing, we show there are many functional degrees in every complete Turning degree. There is a natural tie (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  2. Jeanleah Mohrherr (1986). A Refinement of Low N and High N for the R.E. Degrees. Mathematical Logic Quarterly 32 (1‐5):5-12.score: 120.0
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  3. Douglas Cenzer, Johanna Ny Franklin, Jiang Liu & Guohua Wu (2011). A Superhigh Diamond in the Ce Tt-Degrees. Archive for Mathematical Logic 50 (1-2):33-44.score: 3.0
    The notion of superhigh computably enumerable (c.e.) degrees was first introduced by (Mohrherr in Z Math Logik Grundlag Math 32: 5–12, 1986) where she proved the existence of incomplete superhigh c.e. degrees, and high, but not superhigh, c.e. degrees. Recent research shows that the notion of superhighness is closely related to algorithmic randomness and effective measure theory. Jockusch and Mohrherr proved in (Proc Amer Math Soc 94:123–128, 1985) that the diamond lattice can be embedded into the c.e. tt-degrees (...)
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation