Related papers: Subcomplete forcing principles and definable well-…
We show that, under the assumption of the existence of $M_1^{\#}$, there exists a model on which the restricted nonstationary ideal $\hbox{NS} \upharpoonright A$ is $\aleph_2$-saturated, for $A$ a stationary co-stationary subset of…
In this paper, following an idea of Christophe Chalons, I propose a new kind of forcing axiom, the Maximality Principle, which asserts that any sentence phi holding in some forcing extension V^P and all subsequent extensions V^P*Q holds…
I survey an array of topics in set theory in the context of a novel class of forcing notions: subcomplete forcing. Subcompleteness was originally defined by Ronald Jensen. I have attempted to make the subject somewhat more approachable to…
We introduce bounded category forcing axioms for well-behaved classes $\Gamma$. These are strong forms of bounded forcing axioms which completely decide the theory of some initial segment of the universe $H_{\lambda_\Gamma^+}$ modulo…
We show that under $\BMM$ and "there exists a Woodin cardinal$"$, the nonstationary ideal on $\omega_1$ can not be defined by a $\Sigma_1$ formula with parameter $A \subset \omega_1$. We show that the same conclusion holds under the…
Assuming that there is no inner model with a strong cardinal, the following is shown: any subset of \omega_1 can be made \Delta^1_3 (in the codes) by a reasonable set-forcing; there is a reasonable set-generic extension with a \Delta^1_3…
Recently the second author introduced combinatorial principles that characterize supercompactness for inaccessible cardinals but can also hold true for small cardinals. We prove that the proper forcing axiom PFA implies these principles…
We make use of a finite support product of $\omega_1$ clones of the Jensen minimal $\varPi^1_2$ singleton forcing to obtain a model of ZFC in which every non-empty lightface analytically definable set of reals contains a lightface…
We study the influence of the existence of large cardinals on the existence of wellorderings of power sets of infinite cardinals $\kappa$ with the property that the collection of all initial segments of the wellordering is definable by a…
In [5], Hjorth proved that for every countable ordinal $\alpha$, there exists a complete $\mathcal{L}_{\omega_1,\omega}$-sentence $\phi_\alpha$ that has models of all cardinalities less than or equal to $\aleph_\alpha$, but no models of…
We prove the following theorem: For a partially ordered set Q such that every countable subset has a strict upper bound, there is a forcing notion satisfying ccc such that, in the forcing model, there is a basis of the null ideal of the…
We study $\Sigma_1(\omega_1)$-definable sets (i.e. sets that are equal to the collection of all sets satisfying a certain $\Sigma_1$-formula with parameter $\omega_1$) in the presence of large cardinals. Our results show that the existence…
We develop a forcing poset with finite conditions which adds a partial square sequence on a given stationary set, with adequate sets of models as side conditions. We then develop a kind of side condition product forcing for simultaneously…
The bounded proper forcing axiom BPFA is the statement that for any family of aleph_1 many maximal antichains of a proper forcing notion, each of size aleph_1, there is a directed set meeting all these antichains. A regular cardinal kappa…
Assuming $M_1$, the canonical inner model with one Woodin cardinal exists, we construct a model in which the nonstationary ideal on $\omega_1$ is $\aleph_2$-saturated, $\Delta_1$-definable with $\omega_1$ as the only parameter and there is…
We study the influence of strong forcing axioms on the complexity of the non-stationary ideal on $\omega_2$ and its restrictions to certain cofinalities. Our main result shows that the strengthening $MM^{++}$ of Martin's Maximum does not…
We produce, relative to a ${\sf ZFC}$ model with a supercompact cardinal, a ${\sf ZFC}$ model of the Proper Forcing Axiom in which the nonstationary ideal on $\omega_1$ is $\Pi_1$-definable in a parameter from $H_{\aleph_2}$.
We prove the following theorem: For a partially ordered set Q such that every countable subset has a strict upper bound, there is a forcing notion satisfying ccc such that, in the forcing model, there is a basis of the meager ideal of the…
We present a sufficient condition for irreducibility of forcing algebras and study the (non)-reducedness phenomenon. Furthermore, we prove a criterion for normality for forcing algebras over a polynomial base ring with coefficients in a…
This paper obtains a completeness result for inequational reasoning with applicative terms without variables in a setting where the intended semantic models are the full structures, the full type hierarchies over preorders for the base…