Switch to: References

Add citations

You must login to add citations.
  1. Many countable support iterations of proper forcings preserve Souslin trees.Heike Mildenberger & Saharon Shelah - 2014 - Annals of Pure and Applied Logic 165 (2):573-608.
    We show that many countable support iterations of proper forcings preserve Souslin trees. We establish sufficient conditions in terms of games and we draw connections to other preservation properties. We present a proof of preservation properties in countable support iterations in the so-called Case A that does not need a division into forcings that add reals and those who do not.
    Download  
     
    Export citation  
     
    Bookmark  
  • Diamond principles in Cichoń’s diagram.Hiroaki Minami - 2005 - Archive for Mathematical Logic 44 (4):513-526.
    We present several models which satisfy CH and some ♦-like principles while others fail, answering a question of Moore, Hrušák and Džamonja.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Prime ideals on P ω (λ) with the partition property.Pierre Matet, Cédric Péan & Stevo Todorcevic - 2002 - Archive for Mathematical Logic 41 (8):743-764.
    We use ideas of Fred Galvin to show that under Martin's axiom, there is a prime ideal on Pω (λ) with the partition property for every \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}\end{document}.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • The club principle and the distributivity number.Heike Mildenberger - 2011 - Journal of Symbolic Logic 76 (1):34 - 46.
    We give an affirmative answer to Brendle's and Hrušák's question of whether the club principle together with h > N₁ is consistent. We work with a class of axiom A forcings with countable conditions such that q ≥ n p is determined by finitely many elements in the conditions p and q and that all strengthenings of a condition are subsets, and replace many names by actual sets. There are two types of technique: one for tree-like forcings and one for (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation