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

4 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 (3 more)  
     
    My bibliography  
     
    Export citation  
  2. Richard Friedberg (1957). A Criterion for Completeness of Degrees of Unsolvability. Journal of Symbolic Logic 22 (2):159-160.score: 120.0
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  3. John M. MacIntyre (1977). Transfinite Extensions of Friedberg's Completeness Criterion. Journal of Symbolic Logic 42 (1):1-10.score: 12.0
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  4. 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 (2 more)  
     
    My bibliography  
     
    Export citation