Switch to: Citations

References in:

Theorie der Numerierungen I

Mathematical Logic Quarterly 19 (19‐25):289-388 (1973)

Add references

You must login to add references.
  1. Classes of Recursively Enumerable Sets and their Decision Problems.H. G. Rice - 1954 - Journal of Symbolic Logic 19 (2):121-122.
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • Standard Classes of Recursively Enumerable Sets.A. H. Lachlan - 1964 - Mathematical Logic Quarterly 10 (2-3):23-42.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • (1 other version)Recursively enumerable classes and their application to recursive sequences of formal theories.Marian Boykan Pour-El & Hilary Putnam - 1965 - Archive for Mathematical Logic 8 (3-4):104-121.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • (1 other version)Gödel numberings of partial recursive functions.Hartley Rogers - 1958 - Journal of Symbolic Logic 23 (3):331-341.
    Download  
     
    Export citation  
     
    Bookmark   20 citations  
  • (2 other versions)Creative sets.John Myhill - 1955 - Mathematical Logic Quarterly 1 (2):97-108.
    Download  
     
    Export citation  
     
    Bookmark   38 citations  
  • (1 other version)Recursively Enumerable Classes and Their Application to Recursive Sequences of Formal Theories.Marian Boykan Pour-el, Hilary Putnam, William A. Howard & A. H. Lachlan - 1973 - Journal of Symbolic Logic 38 (1):155-156.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • On the indexing of classes of recursively enumerable sets.A. H. Lachlan - 1966 - Journal of Symbolic Logic 31 (1):10-22.
    Download  
     
    Export citation  
     
    Bookmark   3 citations