13 citations · 26 across the 20 of their papers we have counts for
Showing 2001Show all
2 papers · 1 filter
math.LO2001
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.
math.LO2001
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…