Switch to: References

Add citations

You must login to add citations.
  1. The limits of E-recursive enumerability.Gerald E. Sacks - 1986 - Annals of Pure and Applied Logic 31:87-120.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Countably decomposable admissible sets.Menachem Magidor, Saharon Shelah & Jonathan Stavi - 1984 - Annals of Pure and Applied Logic 26 (3):287-361.
    The known results about Σ 1 -completeness, Σ 1 -compactness, ordinal omitting etc. are given a unified treatment, which yields many new examples. It is shown that the unifying theorem is best possible in several ways, assuming V = L.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • The limits of "E"-recursive enumerability.G. E. Sacks - 1986 - Annals of Pure and Applied Logic 31:87.
    Download  
     
    Export citation  
     
    Bookmark   1 citation