7 found
Order:
  1. Robert E. Byerly (1984). Some Properties of Invariant Sets. Journal of Symbolic Logic 49 (1):9-21.
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography  
  2.  4
    Robert E. Byerly (1984). Definability of Recursively Enumerable Sets in Abstract Computational Complexity Theory. Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 30 (32-34):499-503.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  3.  12
    Robert E. Byerly (1982). Recursion Theory and the Lambda-Calculus. Journal of Symbolic Logic 47 (1):67-83.
    A semantics for the lambda-calculus due to Friedman is used to describe a large and natural class of categorical recursion-theoretic notions. It is shown that if e 1 and e 2 are godel numbers for partial recursive functions in two standard ω-URS's 1 which both act like the same closed lambda-term, then there is an isomorphism of the two ω-URS's which carries e 1 to e 2.
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography  
  4.  3
    Robert E. Byerly (1982). An Invariance Notion in Recursion Theory. 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 (6 more)  
     
    Export citation  
     
    My bibliography  
  5.  1
    Robert E. Byerly (1983). Definability of R. E. Sets in a Class of Recursion Theoretic Structures. Journal of Symbolic Logic 48 (3):662-669.
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography  
  6. Robert E. Byerly (1984). Definability of Recursively Enumerable Sets in Abstract Computational Complexity Theory. Mathematical Logic Quarterly 30 (32‐34):499-503.
  7. J. C. Shepherdson, A. J. Kfoury, R. Statman & Robert E. Byerly (1990). Algorithmic Procedures, Generalized Turing Algorithms, and Elementary Recursion Theory. Journal of Symbolic Logic 55 (2):876-878.
    Direct download  
     
    Export citation  
     
    My bibliography