Switch to: Citations

Add references

You must login to add references.
  1. Set Theory.Keith J. Devlin - 1981 - Journal of Symbolic Logic 46 (4):876-877.
    Download  
     
    Export citation  
     
    Bookmark   163 citations  
  • Aronszajn trees and the independence of the transfer property.William Mitchell - 1972 - Annals of Mathematical Logic 5 (1):21.
    Download  
     
    Export citation  
     
    Bookmark   93 citations  
  • Shelah's pcf theory and its applications.Maxim R. Burke & Menachem Magidor - 1990 - Annals of Pure and Applied Logic 50 (3):207-254.
    This is a survey paper giving a self-contained account of Shelah's theory of the pcf function pcf={cf:D is an ultrafilter on a}, where a is a set of regular cardinals such that a
    Download  
     
    Export citation  
     
    Bookmark   32 citations  
  • On the Hamkins approximation property.William J. Mitchell - 2006 - Annals of Pure and Applied Logic 144 (1-3):126-129.
    We give a short proof of a lemma which generalizes both the main lemma from the original construction in the author’s thesis of a model with no ω2-Aronszajn trees, and also the “Key Lemma” in Hamkins’ gap forcing theorems. The new lemma directly yields Hamkins’ newer lemma stating that certain forcing notions have the approximation property.
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  • Reflecting stationary sets and successors of singular cardinals.Saharon Shelah - 1991 - Archive for Mathematical Logic 31 (1):25-53.
    REF is the statement that every stationary subset of a cardinal reflects, unless it fails to do so for a trivial reason. The main theorem, presented in Sect. 0, is that under suitable assumptions it is consistent that REF and there is a κ which is κ+n -supercompact. The main concepts defined in Sect. 1 are PT, which is a certain statement about the existence of transversals, and the “bad” stationary set. It is shown that supercompactness (and even the failure (...)
    Download  
     
    Export citation  
     
    Bookmark   41 citations  
  • On the $\kappa$ -cub game on $\lambda $ and $I[\lambda ]$.Taneli Huuskonen, Tapani Hyttinen & Mika Rautila - 1999 - Archive for Mathematical Logic 38 (8):549-557.
    We discuss the relationships between the notions of $\kappa $ -cub game on $\lambda $ , $\kappa $ -cub subset of $\lambda $ , the ideal of good subsets of $\lambda $ and the problem of adding a $\kappa $ -cub into a given $\kappa $ -stationary subset of $\lambda $ . We also give a short introduction to the ideal of good subsets of $\lambda $.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • On Borel equivalence relations in generalized Baire space.Sy-David Friedman & Tapani Hyttinen - 2012 - Archive for Mathematical Logic 51 (3-4):299-304.
    We construct two Borel equivalence relations on the generalized Baire space κκ, κ ω, with the property that neither of them is Borel reducible to the other. A small modification of the construction shows that the straightforward generalization of the Glimm-Effros dichotomy fails.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Remarks on strong nonstructure theorems.Tapani Hyttinen, Saharon Shelah & Heikki Tuuri - 1993 - Notre Dame Journal of Formal Logic 34 (2):157-168.
    Download  
     
    Export citation  
     
    Bookmark   3 citations