Powered by OpenAIRE graph
Found an issue? Give us feedback
addClaim

This Research product is the result of merged Research products in OpenAIRE.

You have already added 0 works in your ORCID record related to the merged Research product.

SELECTIVE INDEPENDENCE AND $h$-PERFECT TREE FORCING NOTIONS (Recent Developments in Set Theory of the Reals)

SELECTIVE INDEPENDENCE AND $h$-PERFECT TREE FORCING NOTIONS (Recent Developments in Set Theory of the Reals)

Abstract

Generalizing the proof for Sacks forcing, we show that the h-perfect tree forcing notions introduced by Goldstern, Judah and Shelah preserve selective independent families even when iterated. As a result we obtain new proofs of the consistency of i= u < non(N) = cof(N) and i < u = non(N) = cof(N) as well as some related results.

Powered by OpenAIRE graph
Found an issue? Give us feedback