Abstract
In this paper we provide a general tool to prove the consistency of with various combinatorial properties at typical at settings with , that does not need a profound knowledge of the forcing notions involved. Examples of such properties are the first failure of GCH, a very good scale and the negation of the approachability property, or the tree property at and .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.