The ultrafilter and almost disjointness numbers
From MaRDI portal
Publication:2039555
DOI10.1016/j.aim.2021.107805zbMath1493.03009arXiv2012.02306OpenAlexW3169987674MaRDI QIDQ2039555
Damjan Kalajdzievski, Osvaldo Guzmán González
Publication date: 5 July 2021
Published in: Advances in Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2012.02306
Consistency and independence results (03E35) Other combinatorial set theory (03E05) Cardinal characteristics of the continuum (03E17)
Related Items (3)
A simple \(P_{\aleph_1}\)-point and a simple \(P_{\aleph_2}\)-point ⋮ Strongly unfoldable, splitting and bounding ⋮ Towers, mad families, and unboundedness
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Katětov and Katětov-Blass orders on \(F_\sigma \)-ideals
- Mathias-Prikry and Laver-Prikry type forcing
- Bounding, splitting, and almost disjointness
- Template iterations with non-definable ccc forcing notions
- Canjar filters
- Forcing with quotients
- There may be simple \(P_{\aleph _ 1}\)- and \(P_{\aleph _ 2}\)-points and the Rudin-Keisler ordering may be downward directed
- Selctive ultrafilters and homogeneity
- Mob families and mad families
- Definability and almost disjoint families
- A model with no strongly separable almost disjoint families
- Forcing indestructibility of MAD families
- Two cardinal invariants of the continuum \(({\mathfrak d} <{\mathfrak a})\) and FS linearly ordered iterated forcing
- Forcing with filters and complete combinatorics
- Malykhin's problem
- Matrix iterations and Cichon's diagram
- Katětov order on Borel ideals
- Dimension theory and forcing
- Four and more
- Cohen-stable families of subsets of integers
- MATHIAS FORCING AND COMBINATORIAL COVERING PROPERTIES OF FILTERS
- On strong $P$-points
- Some observations on filters with properties defined by open covers
- Mathias Forcing which does not Add Dominating Reals
- Proper Forcing
- Combinatorial Cardinal Characteristics of the Continuum
- Cardinal Arithmetic
- Mad families, splitting families and large continuum
- Forcing Properties of Ideals of Closed Sets
- Countable Fréchet Boolean groups: An independence result
- The consistency of b=κ and s=κ+
- Preserving P-points in definable forcing
- Products of Infinitely Many Perfect Trees
- Zapping Small Filters
- Happy families
- Semiselective coideals
- Parametrized $\diamondsuit $ principles
- COHERENT SYSTEMS OF FINITE SUPPORT ITERATIONS
- Ordering MAD families a la Katětov
- The almost-disjointness number may have countable cofinality
- Combinatorial Set Theory
- Template iterations and maximal cofinitary groups
- Splitting, Bounding, and Almost Disjointness Can Be Quite Different
- Diagonalising an ultrafilter and preserving a $P$-point
- Comparing the closed almost disjointness and dominating numbers
- Mad Families Constructed from Perfect Almost Disjoint Families
- Selection principles and covering properties in Topology
This page was built for publication: The ultrafilter and almost disjointness numbers
