Switch to: Citations

Add references

You must login to add references.
  1. Theory of recursive functions and effective computability.Hartley Rogers - 1987 - Cambridge, Mass.: MIT Press.
  • Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
    Direct download  
     
    Export citation  
     
    Bookmark   594 citations  
  • Some properties of invariant sets.Robert E. Byerly - 1984 - Journal of Symbolic Logic 49 (1):9-21.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • An invariance notion in recursion theory.Robert E. Byerly - 1982 - Journal of Symbolic Logic 47 (1):48-66.
    A set of godel numbers is invariant if it is closed under automorphisms of (ω, ·), where ω is the set of all godel numbers of partial recursive functions and · is application (i.e., n · m ≃ φ n (m)). The invariant arithmetic sets are investigated, and the invariant recursively enumerable sets and partial recursive functions are partially characterized.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • Recursively enumerable complexity sequences and measure independence.Victor L. Bennison - 1980 - Journal of Symbolic Logic 45 (3):417-438.