Bounding, splitting, and almost disjointness

@article{Brendle2014BoundingSA,
  title={Bounding, splitting, and almost disjointness},
  author={J{\"o}rg Brendle and Dilip Raghavan},
  journal={Ann. Pure Appl. Log.},
  year={2014},
  volume={165},
  pages={631-651}
}

On the bounding, splitting, and distributivity numbers

The cardinal invariants h, b, s of Ppωq are known to satisfy that ω1 ď h ď mintb, su. We prove that all inequalities can be strict. We also introduce a new upper bound for h and show that it can be

On well-splitting posets

. We introduce a class of proper posets which is preserved under countable support iterations, includes ω ω -bounding, Cohen, Miller, and Mathias posets associated to filters with the Hurewicz

The almost disjointness invariant for products of ideals

. The almost disjointness numbers associated to the quotients determined by the transfinite products of the ideal of finite sets are investigated. A ZFC lower bound involving the minimum of the

ON THE BOUNDING, SPLITTING, AND DISTRIBUTIVITY NUMBERS OF P(N); AN APPLICATION OF LONG-LOW ITERATIONS

The cardinal invariants t, h, b, s of P(N) are known to satisfy that ω1 ≤ t ≤ h ≤ min{b, s} and that b < s and s < b are both consistent. We prove the consistency of each of the following

Partition calculus and cardinal invariants

We prove that the strong polarized relation of $\theta$ above $\omega$ applied simultaneously for every cardinal in the interval $[\aleph_1,\aleph]$ is consistent. We conclude that this positive

Combinatorial properties of MAD families

. We study some strong combinatorial properties of MAD families. An ideal I is Shelah-Stepr¯ans if for every set X ⊆ [ ω ] <ω there is an element of I that either intersects every set in X or

Template iterations with non-definable ccc forcing notions

Splitting, Bounding, and Almost Disjointness Can Be Quite Different

Abstract We prove the consistency of $$~~\text{add}\left( \mathcal{N} \right)<\operatorname{cov}\left( \mathcal{N} \right)<\mathfrak{p}\text{=}\mathfrak{s}\text{=}\mathfrak{g}< \text{add}\left(

References

SHOWING 1-10 OF 16 REFERENCES

Comparing the closed almost disjointness and dominating numbers

We prove that if there is a dominating family of size א1, then there are א1 many compact subsets of ω whose union is a maximal almost disjoint family of functions that is also maximal with respect to

Mad Families Constructed from Perfect Almost Disjoint Families

TLDR
The consistency of is proved together with the existence of a -definable mad family, answering a question posed by Friedman and Zdomskyy in [7, Question 16], and a new cardinal invariant is isolated, the Borel almost-disjointness number.

Partition calculus and cardinal invariants

We prove that the strong polarized relation of $\theta$ above $\omega$ applied simultaneously for every cardinal in the interval $[\aleph_1,\aleph]$ is consistent. We conclude that this positive

Adjoining dominating functions

Abstract If dominating functions in ω ω are adjoined repeatedly over a model of GCH via a finite-support c.c.c. iteration, then in the resulting generic extension there are no long towers, every

Mob families and mad families

TLDR
The consistency of ${\frak o} <{\frak d}$ is shown, where £o$ is the size of the smallest off-branch family, and ${ frak d$ is as usual the dominating number.

Combinatorial Aspects of the Splitting Number

This paper deals with the splitting number $${\mathfrak{s}}$$ and polarized partition relations. In the first section we define the notion of strong splitting families, and prove that its existence

Selective ultrafilters and homogeneity

  • A. Blass
  • Mathematics
    Ann. Pure Appl. Log.
  • 1988

Proper and Improper Forcing

This work deals with set-theoretic independence results (independence from the usual set-theoretic ZFC axioms), in particular for problems on the continuum. Consequently, the theory of iterated

Handbook of Set Theory

Handbook of Set Theory, Volume I, Akihiro Kanamori, 0. Introduction Thomas Jech, 1. Stationary Sets Andras Hajnal and Jean Larson, 2. Partition Relations Stevo Todorcevic, 3. Coherent Sequences Greg

Strong Polarized Relations for the Continuum

We prove that the strong polarized relation $${\left(\begin{array}{ll} 2^\mu\\ \mu \end{array}\right)\rightarrow \left(\begin{array}{ll} 2^\mu\\ \mu \end{array}\right)^{1,1}_2}$$ is consistent with