Regarding reals as functions from $\omega$ to $\omega$, let's say a real $f$ eventually dominates $g$ iff $(\exists n)(\forall m > n)[ f(m) > g(m)]$. Let's say that a (non-trivial separative) forcing poset $P$ doesn't always add a dominating real iff there is a generic extension by $P$ which doesn't contains a real that eventually dominates every real from the ground model. Let's say that $P$ never adds a dominating real iff every generic extension by $P$ doesn't contain any real that eventually dominates all the ground model's reals. I'm interested in combinatorial/order-theoretic conditions which may be necessary or sufficient for either of these notions.
- $\omega$-closure implies you add no reals, hence you add no dominating reals; Cohen forcing is not $\omega$-closed but it never adds a dominating real
- one can show that separability implies you never add a dominating real (by separability, I mean containing a countable dense subset); the Cohen forcing that adds uncountably many reals isn't separable but never adds a dominating real
- Hechler forcing has size at most continuum but always adds a dominating real; the Cohen forcing that adds more than continuum many reals (where "continuum" is "continuum as computed in the ground model" obviously) has size greater than continuum but never adds a dominating real
- Hechler forcing also has the countable chain condition yet adds a dominating real; the forcing that adds a function $\omega _1 \to \omega _1$ with countable partial functions doesn't have the ccc but it's $\omega$-closed hence adds no new reals and thus never adds any dominating reals.
My questionsquestion:
What are some combinatorial/order-theoretic conditions on a poset that are necessary and/or sufficient for the poset to never/not always add a dominating real?
