Brendle, J., H. Judah and S. Shelah, Combinatorial properties of Hechler forcing, Annals of Pure and Applied Logic 59 185–199. Using a notion of rank for Hechler forcing we show: assuming ωV1 = ωL1, there is no real in V[d] which is eventually different from the reals in L[ d], where d is Hechler over V; adding one Hechler real makes the invariants on the left-hand side of Cichoń's diagram equal ω1 and those on the right-hand side equal 2ω and (...) produces a maximal almost disjoint family of subsets of ω of size ω1; there is no perfect set of random reals over V in V[ r][ d], where r is random over V and d Hechler over V[r], thus answering a question of the first and second authors. (shrink)

We show that every analytic set in the Baire space which is dominating contains the branches of a uniform tree, i.e. a superperfect tree with the property that for every splitnode all the successor splitnodes have the same length. We call this property of analytic sets u-regularity. However, we show that the concept of uniform tree does not suffice to characterize dominating analytic sets in general. We construct a dominating closed set with the property that for no uniform tree whose (...) branches are contained in the closed set, the set of these branches is dominating. We also show that from a Σ1n+1-rapid filter a non-u-regular Π1n-set can be constructed. Finally, we prove that ∑12-Kσ-regularity implies ∑12-u-regularity. (shrink)