Switch to: References

Citations of:

Degrees of unsolvability

New York,: American Elsevier (1971)

Add citations

You must login to add citations.
  1. (1 other version)Effectivizing Inseparability.John Case - 1991 - Mathematical Logic Quarterly 37 (7):97-111.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • The knowing mathematician.Nicolas D. Goodman - 1984 - Synthese 60 (1):21 - 38.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • The weak truth table degrees of recursively enumerable sets.Richard E. Ladner & Leonard P. Sasso - 1975 - Annals of Mathematical Logic 8 (4):429-448.
    Download  
     
    Export citation  
     
    Bookmark   33 citations  
  • (1 other version)On Sequences of Degrees of Constructibility (Solution of Friedman'S Problem 75).Bohuslav Balcar & Petr Hájek - 1978 - Mathematical Logic Quarterly 24 (19‐24):291-296.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • (1 other version)Index Sets Universal for Differences of Arithmetic Sets.Louise Hay - 1974 - Mathematical Logic Quarterly 20 (13‐18):239-254.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • (1 other version)Topological framework for finite injury.Kyriakos Kontostathis - 1992 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 38 (1):189-195.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • (1 other version)On Sequences of Degrees of Constructibility (Solution of Friedman'S Problem 75).Bohuslav Balcar & Petr Hájek - 1978 - Mathematical Logic Quarterly 24 (19-24):291-296.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • (1 other version)Topological framework for finite injury.Kyriakos Kontostathis - 1992 - Mathematical Logic Quarterly 38 (1):189-195.
    We formulate an abstract version of the finite injury method in the form of the Baire category theorem. The theorem has the following corollaries: The Friedberg-Muchnik pair of recursively enumerable degrees, the Sacks splitting theorem, the existence of a minimal degree below 0′ and the Shoenfield jump theorem.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • (1 other version)Topological Framework for Non‐Priority.Kyriakos Kontostathis - 1991 - Mathematical Logic Quarterly 37 (31-32):495-500.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • (1 other version)Topological Framework for Non‐Priority.Kyriakos Kontostathis - 1991 - Mathematical Logic Quarterly 37 (31‐32):495-500.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • (1 other version)Effectivizing Inseparability.John Case - 1991 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 37 (7):97-111.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • (1 other version)Completely Autoreducible Degrees.Carl G. Jockusch & Michael S. Paterson - 1976 - Mathematical Logic Quarterly 22 (1):571-575.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • (1 other version)Completely Autoreducible Degrees.Carl G. Jockusch & Michael S. Paterson - 1976 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 22 (1):571-575.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • (1 other version)Index Sets Universal for Differences of Arithmetic Sets.Louise Hay - 1974 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 20 (13-18):239-254.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • (1 other version)Anti‐Mitotic Recursively Enumerable Sets.Klaus Ambos-Spies - 1985 - Mathematical Logic Quarterly 31 (29-30):461-477.
    Download  
     
    Export citation  
     
    Bookmark   10 citations