Mathias-Prikry and Laver type forcing; summable ideals, coideals, and \(+\)-selective filters
DOI10.1007/s00153-016-0476-9zbMath1345.03090arXiv1501.02400OpenAlexW2226710049MaRDI QIDQ283119
Michael Hrušák, David Chodounský, Osvaldo Guzmán González
Publication date: 13 May 2016
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1501.02400
\(\omega\)-hitting\(+\)-selective filterdominating realeventually different reallaver type forcingMathias like realMathias-Prikry forcing
Consistency and independence results (03E35) Other combinatorial set theory (03E05) Cardinal characteristics of the continuum (03E17) Other aspects of forcing and Boolean-valued models (03E40)
Related Items (6)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Mathias-Prikry and Laver-Prikry type forcing
- Bounding, splitting, and almost disjointness
- Canjar filters
- Adding ultrafilters by definable quotients
- Forcing with quotients
- The theory of semisets
- How many Boolean algebras \({\mathcal P}(\mathbb{N})/{\mathcal I}\) are there?
- MATHIAS FORCING AND COMBINATORIAL COVERING PROPERTIES OF FILTERS
- Mathias Forcing which does not Add Dominating Reals
- Countable Fréchet Boolean groups: An independence result
- On Certain Boolean Algebras P(ω)/I
- Combinatorics on ideals and forcing with trees
- Two Classes of Frechet-Urysohn Spaces
- Happy families
- Analytic quotients: theory of liftings for quotients over analytic ideals on the integers
- Properness Without Elementaricity
- Two 𝐹_{𝜎𝛿} ideals
- Continuum-many Boolean algebras of the form Borel
This page was built for publication: Mathias-Prikry and Laver type forcing; summable ideals, coideals, and \(+\)-selective filters