Switch to: Citations

Add references

You must login to add references.
  1. Degrees of models.J. R. Shoenfield - 1960 - Journal of Symbolic Logic 25 (3):233-237.
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Π 1 0 Classes, Peano Arithmetic, Randomness, and Computable Domination.David E. Diamondstone, Damir D. Dzhafarov & Robert I. Soare - 2010 - Notre Dame Journal of Formal Logic 51 (1):127-159.
    We present an overview of the topics in the title and of some of the key results pertaining to them. These have historically been topics of interest in computability theory and continue to be a rich source of problems and ideas. In particular, we draw attention to the links and connections between these topics and explore their significance to modern research in the field.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Separable Theories.A. Ehrenfeucht - 1969 - Journal of Symbolic Logic 34 (1):127-127.
    Download  
     
    Export citation  
     
    Bookmark   2 citations