Switch to: Citations

Add references

You must login to add references.
  1. A criterion for coarse iterability.Gunter Fuchs, Itay Neeman & Ralf Schindler - 2010 - Archive for Mathematical Logic 49 (4):447-467.
    The main result of this paper is the following theorem: Let M be a premouse with a top extender, F. Suppose that (a) M is linearly coarsely iterable via hitting F and its images, and (b) if M * is a linear iterate of M as in (a), then M * is coarsely iterable with respect to iteration trees which do not use the top extender of M * and its images. Then M is coarsely iterable.
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Higher set theory and mathematical practice.Harvey M. Friedman - 1971 - Annals of Mathematical Logic 2 (3):325.
    Download  
     
    Export citation  
     
    Bookmark   43 citations