7 papers · 1 filter
Long low iterations
Heike Mildenberger, Saharon Shelah
We try to control many cardinal characteristics by working with a notion of orthogonality between two families of forcings. We show that b^+<g is consistent
Specializing Aronszajn trees by countable approximations
Heike Mildenberger, Saharon Shelah
We show that there are proper forcings based upon countable trees of creatures that specialize a given Aronszajn tree.
On needed reals
Heike Mildenberger, Saharon Shelah
Following Blass, we call a real a ``needed'' for a binary relation R on the reals if in every R-adequate set we find an element from which a is Turing computable. We show that ever…
The splitting number can be smaller than the matrix chaos number
Heike Mildenberger, Saharon Shelah
Let chi be the minimum cardinal of a subset of 2^omega that cannot be made convergent by multiplication with a single Toeplitz matrix. By an application of creature forcing we show…
The relative consistency of g<cf(Sym(omega))
Heike Mildenberger, Saharon Shelah
We prove the consistency result from the title. By forcing we construct a model of g=aleph_1, b=cf(Sym(omega))=aleph_2.
On absolutely divergent series
Sakae Fuchino, Heike Mildenberger, Saharon Shelah +1
We show that in the aleph_2-stage countable support iteration of Mathias forcing over a model of CH the complete Boolean algebra generated by absolutely divergent series under even…