PERFECT TREES AND ELEMENTARY EMBEDDINGS. SY-DAVID FRIEDMAN AND KATHERINE THOMPSON. Abstract. An important technique in large cardinal set theory is that of ...

Abstract. An important technique in large cardinal set theory is that of extending an elementary embedding j : M → N between inner models to an elementary ...

An important technique in large cardinal set theory is that of extending an elementary embedding j: M → N between inner models to an elementary embedding ...

Perfect trees and elementary embeddings · S. Friedman, K. Thompson · Published in Journal of Symbolic Logic… 1 September 2008 · Mathematics.

An important technique in large cardinal set theory is that of extending an elementary embedding j: M → N between inner models to an elementary embedding j* ...

In this article we use perfect trees to reduce some difficult cases to easy ones, using fusion as a substitute for distributivity. We apply our technique to ...

Original language, English. Pages (from-to), 906-918. Number of pages, 13. Journal, Journal of Symbolic Logic. Volume, 73. Issue number, 3.

In this paper we introduce some fusion properties of forcing notions which guarantee that an iteration with supports of size ⩽κ not only does not collapse κ+ ...

In this chapter we present a survey of the area of set theory in which iter- ated forcing interacts with elementary embeddings. The original plan was to.

Sep 11, 2022 · Is there a way to phrase the tree property (e.g. by using generalised Vκ-trees) which is equivalent to κ being weakly critical? What about ...