Switch to: Citations

Add references

You must login to add references.
  1. (1 other version)Logic with denumerably long formulas and finite strings of quantifiers.Dana Scott - 1965 - Journal of Symbolic Logic 36 (1):1104--329.
    Download  
     
    Export citation  
     
    Bookmark   33 citations  
  • (1 other version)Weak Second‐Order Arithmetic and Finite Automata.J. Richard Büchi - 1960 - Mathematical Logic Quarterly 6 (1-6):66-92.
    Download  
     
    Export citation  
     
    Bookmark   58 citations  
  • The complexity of orbits of computably enumerable sets.Peter A. Cholak, Rodney Downey & Leo A. Harrington - 2008 - Bulletin of Symbolic Logic 14 (1):69 - 87.
    The goal of this paper is to announce there is a single orbit of the c.e. sets with inclusion, ε, such that the question of membership in this orbit is ${\Sigma _1^1 }$ -complete. This result and proof have a number of nice corollaries: the Scott rank of ε is $\omega _1^{{\rm{CK}}}$ + 1; not all orbits are elementarily definable; there is no arithmetic description of all orbits of ε; for all finite α ≥ 9, there is a properly $\Delta (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • (1 other version)Review: Joseph Harrison, Recursive Pseudo-well-Orderings. [REVIEW]Yiannis N. Moschovakis - 1972 - Journal of Symbolic Logic 37 (1):197-198.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • (1 other version)Review: Michael O. Rabin, Decidability of Second-order Theories and Automata on Infinite Trees. [REVIEW]Dirk Siefkes - 1972 - Journal of Symbolic Logic 37 (3):618-619.
    Download  
     
    Export citation  
     
    Bookmark   29 citations