Switch to: References

Add citations

You must login to add citations.
  1. Separation problems and forcing.Jindřich Zapletal - 2013 - Journal of Mathematical Logic 13 (1):1350002.
    Certain separation problems in descriptive set theory correspond to a forcing preservation property, with a fusion type infinite game associated to it. As an application, it is consistent with the axioms of set theory that the circle.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  • Hypergraphs and proper forcing.Jindřich Zapletal - 2019 - Journal of Mathematical Logic 19 (2):1950007.
    Given a Polish space X and a countable collection of analytic hypergraphs on X, I consider the σ-ideal generated by Borel anticliques for the hypergraphs in the family. It turns out that many of the quotient posets are proper. I investigate the forcing properties of these posets, certain natural operations on them, and prove some related dichotomies.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • On splitting trees.Giorgio Laguzzi, Heike Mildenberger & Brendan Stuber-Rousselle - 2023 - Mathematical Logic Quarterly 69 (1):15-30.
    We investigate two variants of splitting tree forcing, their ideals and regularity properties. We prove connections with other well‐known notions, such as Lebesgue measurablility, Baire‐ and Doughnut‐property and the Marczewski field. Moreover, we prove that any absolute amoeba forcing for splitting trees necessarily adds a dominating real, providing more support to Hein's and Spinas' conjecture that.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • Ramsey type properties of ideals.M. Hrušák, D. Meza-Alcántara, E. Thümmel & C. Uzcátegui - 2017 - Annals of Pure and Applied Logic 168 (11):2022-2049.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  • Antichains of perfect and splitting trees.Paul Hein & Otmar Spinas - 2020 - Archive for Mathematical Logic 59 (3-4):367-388.
    We investigate uncountable maximal antichains of perfect trees and of splitting trees. We show that in the case of perfect trees they must have size of at least the dominating number, whereas for splitting trees they are of size at least \\), i.e. the covering coefficient of the meager ideal. Finally, we show that uncountable maximal antichains of superperfect trees are at least of size the bounding number; moreover we show that this is best possible.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations