Search results for 'Richard M. Friedberg' (try it on Scholar)

14 found
Sort by:
  1. Richard M. Friedberg (1958). Three Theorems on Recursive Enumeration. I. Decomposition. II. Maximal Set. III. Enumeration Without Duplication. Journal of Symbolic Logic 23 (3):309-316.score: 290.0
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  2. Richard M. Friedberg & Hartley Rogers (1959). Reducibility and Completeness for Sets of Integers. Mathematical Logic Quarterly 5 (7‐13):117-125.score: 290.0
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  3. Richard Friedberg (1957). A Criterion for Completeness of Degrees of Unsolvability. Journal of Symbolic Logic 22 (2):159-160.score: 120.0
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  4. Alonzo Church (1959). Review: Richard M. Friedberg, 4-Quantifier Completeness: A Banach-Mazur Functional Not Uniformly Partial Recursive. [REVIEW] Journal of Symbolic Logic 24 (1):52-52.score: 90.0
    Direct download  
     
    My bibliography  
     
    Export citation  
  5. Marian Boykan Pour-El (1960). Review: Richard M. Friedberg, Three Theorems on Recursive Enumeration. I. Decomposition. II. Maximal Set. III. Enumeration Without Duplication. [REVIEW] Journal of Symbolic Logic 25 (2):165-166.score: 90.0
    Direct download  
     
    My bibliography  
     
    Export citation  
  6. Marian Boykan Pour-El (1960). Review: Richard M. Friedberg, A Criterion for Completeness of Degrees of Unsolvability. [REVIEW] Journal of Symbolic Logic 25 (2):165-165.score: 90.0
    Direct download  
     
    My bibliography  
     
    Export citation  
  7. Gerald E. Sacks (1960). Review: Richard M. Friedberg, Hartley Rogers, Reducibility and Completeness for Sets of Integers. [REVIEW] Journal of Symbolic Logic 25 (4):362-363.score: 90.0
    Direct download  
     
    My bibliography  
     
    Export citation  
  8. Hartley Rogers (1958). Review: R. M. Friedberg, Two Recursively Enumerable Sets of Incomparable Degrees of Unsolvability (Solution of Post's Problem, 1944). [REVIEW] Journal of Symbolic Logic 23 (2):225-226.score: 42.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  9. Gerald E. Sacks (1963). Review: R. M. Friedberg, The Fine Structure of Degrees of Unsolvability of Recursively Enumerable Sets. [REVIEW] Journal of Symbolic Logic 28 (2):166-166.score: 42.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  10. Marian Boykan Pour-El (1959). Review: Richard Friedberg, Un Contre-Exemple Relatif aux Fonctionnelles Recursives. [REVIEW] Journal of Symbolic Logic 24 (2):171-171.score: 36.0
    Translate to English
    | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  11. Marian Boykan Pour-El (1960). Review: Richard Friedberg, The Uniqueness of Finite Division for Recursive Equivalence Types. [REVIEW] Journal of Symbolic Logic 25 (4):363-363.score: 36.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  12. Robert A. Di Paola (1981). A Lift of a Theorem of Friedberg: A Banach-Mazur Functional That Coincides with No Α-Recursive Functional on the Class of Α-Recursive Functions. Journal of Symbolic Logic 46 (2):216 - 232.score: 23.0
    R. M. Friedberg demonstrated the existence of a recursive functional that agrees with no Banach-Mazur functional on the class of recursive functions. In this paper Friedberg's result is generalized to both α-recursive functionals and weak α-recursive functionals for all admissible ordinals α such that $\lambda , where α * is the Σ 1 -projectum of α and λ is the Σ 2 -cofinality of α. The theorem is also established for the metarecursive case, α = ω 1 , (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  13. John M. MacIntyre (1977). Transfinite Extensions of Friedberg's Completeness Criterion. Journal of Symbolic Logic 42 (1):1-10.score: 12.0
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  14. Michael Mytilinaios (1989). Finite Injury and ∑1-Induction. Journal of Symbolic Logic 54 (1):38 - 49.score: 12.0
    Working in the language of first-order arithmetic we consider models of the base theory P - . Suppose M is a model of P - and let M satisfy induction for σ 1 -formulas. First it is shown that the Friedberg-Muchnik finite injury argument can be performed inside M, and then, using a blocking method for the requirements, we prove that the Sacks splitting construction can be done in M. So, the "amount" of induction needed to perform the known (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation