Switch to: Citations

Add references

You must login to add references.
  1. Some independence results related to the Kurepa tree.Renling Jin - 1991 - Notre Dame Journal of Formal Logic 32 (3):448-457.
  • A model in which every Kurepa tree is thick.Renling Jin - 1991 - Notre Dame Journal of Formal Logic 33 (1):120-125.
  • Set Theory: An Introduction to Independence Proofs.Kenneth Kunen - 1980 - North-Holland.
  • The differences between Kurepa trees and Jech-Kunen trees.Renling Jin - 1993 - Archive for Mathematical Logic 32 (5):369-379.
    By an ω1 we mean a tree of power ω1 and height ω1. An ω1-tree is called a Kurepa tree if all its levels are countable and it has more than ω1 branches. An ω1-tree is called a Jech-Kunen tree if it has κ branches for some κ strictly between ω1 and $2^{\omega _1 }$ . In Sect. 1, we construct a model ofCH plus $2^{\omega _1 } > \omega _2$ , in which there exists a Kurepa tree with not (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • Trees.Thomas J. Jech - 1971 - Journal of Symbolic Logic 36 (1):1-14.
  • [Omnibus Review].Kenneth Kunen - 1969 - Journal of Symbolic Logic 34 (3):515-516.