Related papers: Amoeba-absoluteness and projective measurability

Measurability with respect to ideals is tightly connected with absoluteness principles for certain forcing notions. We study a uniformization principle that postulates the existence of a uniformizing function on a large set, relative to a…

In this paper we analyse some notions of amoeba for tree forcings. In particular we introduce an amoeba-Silver and prove that it satisfies quasi pure decision but not pure decision. Further we define an amoeba-Sacks and prove that it…

We prove that if Q is a nw-nep forcing then it cannot add a dominating real. We also prove that Amoeba forcing cannot be P(X)/I if I is an aleph_1-complete ideal.

In this short note, we shall prove some observations regarding the connection between indestructible $\omega_1$-guessing models and the $\omega_1$-approximation property of forcing notions.

Solovay's arithmetical completeness theorem states that the modal logic of provability coincides with the modal logic $\mathbf{GL}$. Hamkins and L\"owe studied the modal logical aspects of set theoretic multiverse and proved that the modal…

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 develop a toolbox for forcing over arbitrary models of set theory without the axiom of choice. In particular, we introduce a variant of the countable chain condition and prove an iteration theorem that applies to many classical forcings…

We show that the Proper Forcing Axiom for forcing notions of size $\aleph_1$ is consistent with the continuum being arbitrarily large. In fact, assuming $GCH$ holds and $\kappa\geq\omega_2$ is a regular cardinal, we prove that there is a…

We investigate two variants of splitting tree forcing, their ideals and regularity properties. We prove connections with other well-known notions, such as Lebesgue measurablility, Baire- and Doughnut-property and the Marczewski field.…

We prove that if $\mathcal{A}$ is a $\sigma$-complete Boolean algebra in a model $V$ of set theory and $\mathbb{P}\in V$ is a proper forcing with the Laver property preserving the ground model reals non-meager, then every pointwise…

Generic absoluteness is the phenomenon that certain truths in the set-theoretic universe remain stable under forcing expansions. A classical result by Kripke asserts that every complete Boolean algebra completely embeds into a countably…

We use the Sigma^1_3 absoluteness theorem to show that the complexity of the statement "(omega,E)$ is isomorphic to an initial segment of the core model" is Pi^1_4, and that the complexity of the statement "(omega,E)$ is isomorphic to a…

We give characterizations for the (in ZFC unprovable) sentences ``Every $\Sb{1}{2}$--set is measurable" and ``Every $\Db{1}{2}$--set is measurable" for various notions of measurability derived from well--known forcing partial orderings.

We study the implications of model completeness of a theory for the effectiveness of presentations of models of that theory. It is immediate that for a computable model $\mathcal A$ of a computably enumerable, model complete theory, the…

The purpose of this paper is to present a general method for forcing on $\omega_2$ and $\omega_3$ with finite conditions, while preserving all cardinals and some fragments of $\mathrm{GCH}$. This method is based on the technique of forcing…

We present a general framework for forcing on $\omega_2$ with finite conditions using countable models as side conditions. This framework is based on a method of comparing countable models as being membership related up to a large initial…

We discuss ways of adjoining perfect sets of mutually generic random reals. In particular, we show that if V \sub W are models of ZFC and W contains a dominating real over V, then W[r], where r is random over W, contains a perfect tree of…

We give a brief survey on the interplay between forcing axioms and various other non-constructive principles widely used in many fields of abstract mathematics, such as the axiom of choice and Baire's category theorem. First of all we…

We use forcing over admissible sets to show that, for every ordinal $\alpha$ in a club $C\subset\omega_1$, there are copies of $\alpha$ such that the isomorphism between them is not computable in the join of the complete $\Pi^1_1$ set…

We study principles of the form: if a name $\sigma$ is forced to have a certain property $\varphi$, then there is a ground model filter $g$ such that $\sigma^g$ satisfies $\varphi$. We prove a general correspondence connecting these name…