Related papers: Restrictions on Forcings That Change Cofinalities
The lottery preparation, a new general kind of Laver preparation, works uniformly with supercompact cardinals, strongly compact cardinals, strong cardinals, measurable cardinals, or what have you. And like the Laver preparation, the lottery…
Let $\mathcal{SN}$ be the strong measure zero $\sigma$-ideal. We prove a result providing bounds for $\mathrm{cof}(\mathcal{SN})$ which implies Yorioka's characterization of the cofinality of the strong measure zero. In addition, we use…
We prove a number of results about countable Borel equivalence relations with forcing constructions and arguments. These results reveal hidden regularity properties of Borel complete sections on certain orbits. As consequences they imply…
Dobrinen, Hathaway and Prikry studied a forcing $\mathbb{P}_\kappa$ consisting of perfect trees of height $\lambda$ and width $\kappa$ where $\kappa$ is a singular $\omega$-strong limit of cofinality $\lambda$. They showed that if $\kappa$…
This paper develops a rich theory of cardinality in the paraconsistent and paracomplete set theory $\mathrm{BZFC}$, where sets can be inconsistent ($A$ such that ``$x\in A$'' is both true and false for some $x$) or incomplete ($A$ such that…
We study variants of classical Laver forcing defined from co-ideals and analyze their combinatorial properties in terms of the Kat\v{e}tov order. In particular, we give a Kat\v{e}tov-theoretic characterization of when Laver forcing…
We study which $\kappa$-distributive forcing notions of size $\kappa$ can be embedded into tree Prikry forcing notions with $\kappa$-complete ultrafilters under various large cardinal assumptions. An alternative formulation -- can the…
Cummings, Foreman, and Magidor investigated the extent to which square principles are compact at singular cardinals. The first author proved that if $\kappa$ is a singular strong limit of uncountable cofinality, all scales on $\kappa$ are…
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…
Chain conditions are one of the major tools used in the theory of forcing. We say that a partial order has the countable chain condition if every antichain (in the sense of forcing) is countable. Without the axiom of choice antichains tend…
The feeling that those two forcing notions-Cohen and Random-(equivalently the corresponding Boolean algebras Borel(R)/(meager sets), Borel(R)/(null sets)) are special, was probably old and widespread. A reasonable interpretation is to show…
Supercompact extender based forcings are used to construct models with HOD cardinal structure different from those of V. In particular, a model with all regular uncountable cardinals measurable in HOD is constructed.
Answering a question of Usuba, we show that an extendible cardinal can be preserved by a set forcing that is not a small forcing.
We define and investigate versions of Silver and Mathias forcing with respect to lower and upper density. We focus on properness, Axiom A, chain conditions, preservation of cardinals and adding Cohen reals. We find rough forcings that…
We study uncountable structures similar to the Fra\"iss\'e limits. The standard inductive arguments from the Fra\"iss\'e theory are replaced by forcing, so the structures we obtain are highly sensitive to the universe of set theory. In…
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 present a method to iterate finitely splitting lim-sup tree forcings along non-wellfounded linear orders. We apply this method to construct a forcing (without using an inaccessible or amalgamation) that makes all definable sets of reals…
We continue the development of the theory of construction schemes over $\omega_1$ as introduced by the third author by studying their relation with forcing axioms. Formally, we introduce the cardinals $\mathfrak{m}^n_{\mathcal{F}}$ and use…
We develop a new method for building forcing iterations with symmetric systems of structures as side conditions. Using our method we prove that the forcing axiom for the class of all the small finitely proper posets is compatible with a…
We bring forward a logical system of transition algebras that enhances many-sorted first-order logic using features from dynamic logics. The sentences we consider include compositions, unions, and transitive closures of transition…