Related papers: Sigma-Prikry forcing II: Iteration Scheme
In this paper we introduce and study the notion of dynamical forcing. Basically, we develop a toolkit of techniques to produce finitely presented groups which can only act on the circle with certain prescribed dynamical properties. As an…
We study the Magidor iteration of Prikry forcings below a measurable limit of measurables $ \kappa $. We first characterize all the normal measures $ \kappa $ carries in the generic extension, building on and extending the main result of…
The notion of stationary reflection is one of the most important notions of combinatorial set theory. We investigate weak reflection, which is, as the name suggests, a weak version of stationary reflection. This sort of reflection was…
We introduce a method that produces a bijection between the posets ${\rm silt-}{A}$ and ${\rm silt-}{B}$ formed by the isomorphism classes of basic silting complexes over finite-dimensional $k$-algebras $A$ and $B$, by lifting $A$ and $B$…
We demonstrate that the technology of Radin forcing can be used to transfer compactness properties at a weakly inaccessible but not strong limit cardinal to a strongly inaccessible cardinal. As an application, relative to the existence of…
If T has only countably many complete types, yet has a type of infinite multiplicity then there is a ccc forcing notion Q such that, in any Q --generic extension of the universe, there are non-isomorphic models M_1 and M_2 of T that can be…
We prove that it is consistent that Club Stationary Reflection and the Special Aronszajn Tree Property simultaneously hold on $\omega_2$, thereby contributing to the study of the tension between compactness and incompactness in set theory.…
A stationary subset S of a regular uncountable cardinal kappa reflects fully at regular cardinals if for every stationary set T subseteq kappa of higher order consisting of regular cardinals there exists an alpha in T such that S cap alpha…
We deal with an iteration theorem of forcing notion with a kind of countable support of nice enough forcing notion which is proper aleph_2-c.c. forcing notions. We then look at some special cases (Q_D 's preceded by random forcing).
We prove forcing axiom equivalents of two families of weakenings of the axiom of choice: a trichotomy principle for cardinals isolated by L\'evy, ${\rm H\hskip0.05pt}_\kappa$, and ${\rm DC}_\kappa$, the principle of dependent choices…
We analyze a natural function definable from a scale at a singular cardinal, and using this function we are able to obtain quite strong negative square-brackets partition relations at successors of singular cardinals. The proof of our main…
We prove that Galvin's property consistently fails at successors of strong limit singular cardinals. We also prove the consistency of this property failing at every successor of a singular cardinal. In addition, the paper analyzes the…
Shelah shows that certain revised countable support (RCS) iterations do not add reals. His motivation is to establish the independence (relative to large cardinals) of Avraham's problem on the existence of uncountable non-constuctible…
We show how to construct, via forcing, splitting families than are preserved by a certain type of finite support iterations. As an application, we construct a model where 15 classical characteristics of the continuum are pairwise different,…
We establish natural criteria under which normally iterable premice are iterable for stacks of normal trees. Let $\Omega$ be a regular uncountable cardinal. Let $m<\omega$ and $M$ be an $m$-sound premouse and $\Sigma$ be an…
If T is an iteration tree on K and F is a countably certified extender that coheres with the final model of T, then F is on the extender sequence of the final model of T. Several applications of maximality are proved, including: o K…
A subset $S$ of initially infected vertices of a graph $G$ is called forcing if we can infect the entire graph by iteratively applying the following process. At each step, any infected vertex which has a unique uninfected neighbour, infects…
We study the question of when a given countable ordinal $\alpha$ is $\Sigma^1_n$- or $\Pi^1_n$-reflecting in models which are neither $\mathsf{PD}$ models nor the constructible universe, focusing on generic extensions of $L$. We prove,…
In this paper, we study some variations of Namba forcing $\mathrm{Nm}(\kappa,\lambda)$ over $\mathcal{P}_{\kappa}\lambda$ and show that its semiproperness implies $\mathrm{SSR}([\lambda]^{\omega},{<}\kappa)$. In particular, Prikry forcing…
A forcing extension may create new isomorphisms between two models of a first order theory. Certain model theoretic constraints on the theory and other constraints on the forcing can prevent this pathology. A countable first order theory is…