Related papers: $^*$Forcing

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 show that for a Suslin ccc forcing notion $\mathbb Q$ adding a Hechler real, ``$\text{ZF}+\text{DC}_{\omega_1}+$all sets of reals are $I_{\mathbb Q,\aleph_0}$-measurable'' implies the existence of an inner model with a measurable…

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…

Based on the work of Shelah, Kellner, and T\u{a}nasie (Fund. Math., 166(1-2):109-136, 2000 and Comment. Math. Univ. Carolin., 60(1):61-95, 2019), and the recent developments in the third author's master's thesis, we develop a general theory…

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 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…

In these notes we present the method introduced by Neeman of generalized side conditions with two types of models. We then discuss some applications: the Friedman-Mitchell poset for adding a club in \omega_2 with finite conditions,…

In chapter 9 of his book "The Axiom of Determinacy, Forcing Axioms, and the Nonstationary Ideal", Woodin shows how to force the Strong Chang Conjecture over models of determinacy using $\mathbb{P}_{\mathrm{max}}$. We show here how a…

We try to build, provably in ZFC, for a first order T a model in which any isomorphism between two Boolean algebras is definable. The problem, compared to [Sh:384], is with pseudo-finite Boolean algebras. A side benefit is that we do not…

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…

We study some properies of $Z^{*}$ algebras, thos C^* algebra which all positive elements are zero divisors. We show by means of an example that an extension of a Z* algebra by a Z* algebra is not necessarily Z* algebra. However we prove…

This is an overview about a method of constructing ccc forcings: Suppose first that a continuous, commutative system of complete embeddings between countable forcings indexed along $\omega_1$ is given. Then its direct limit satisfies ccc by…

In light of the celebrated theorem of Vop\v{e}nka (1972), proving in ZFC that every set is generic over HOD, it is natural to inquire whether the set-theoretic universe $V$ must be a class-forcing extension of HOD by some possibly…

I introduce a new family of axioms extending ZFC set theory, the $\Sigma_n$-correct forcing axioms. These assert roughly that whenever a forcing name $\dot{a}$ can be forced by a poset in some forcing class $\Gamma$ to have some $\Sigma_n$…

We investigate classes of Boolean algebras related to the notion of forcing that adds Cohen reals. A >>Cohen algebra<< is a Boolean algebra that is dense in the completion of a free Boolean algebra. We introduce and study generalizations of…

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…

Absolute model companionship (AMC) is a strict strengthening of model companionship defined as follows: For a theory $T$, $T_{\exists\vee\forall}$ denotes the logical consequences of $T$ which are boolean combinations of universal…

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…

We compare the forcing related properties of a complete Boolean algebra B with the properties of the convergences $\lambda_s$ (the algebraic convergence) and $\lambda_{ls}$ on B generalizing the convergence on the Cantor and Aleksandrov…

We show that while the length $\omega$ iterated ultrapower by a normal ultrafilter is a Boolean ultrapower by the Boolean algebra of Prikry forcing, it is consistent that no iteration of length greater than $\omega$ (of the same ultrafilter…