arXiv subjects
Publications and source records attributed to Asaf Karagila.
J.L. Krivine developed a new method based on realizability to construct models of set theory where the axiom of choice fails. We attempt to recreate his results in classical settings, i.e. symmetric extensions. We also provide a new condition for preserving well-ordered, and other particular type of choice, in the general settings of symmetric extensions.
Methods of Higher Forcing Axioms was a small workshop in Norwich, taking place between 10--12 of September, 2019. The goal was to encourage future collaborations, and create more focused threads of research on the topic of higher forcing axioms. This is an improved version of the notes taken during the meeting by Asaf Karagila.
Douglass B. Morris announced in 1970 that it is consistent with ZF that "For every $α$, there exists a set $A_α$ which is the countable union of countable sets, and $\mathcal P(A_α)$ can be partitioned into $\aleph_α$ non-empty sets". The result was never published in a journal (it was proved in full in Morris' dissertation) and seems to have been lost, save a mention in Jech's "Axiom of Choice". We provide a proof using modern tools derived from recent work of the author. We also prove a new preservation theorem for general products of symmetric systems, which we use to obtain the consistency of Dependent Choice with the above statement (replacing "countable union of countable sets" by "union of $κ$ sets of size $κ$").
We introduce the notion of a critical cardinal as the critical point of sufficiently strong elementary embedding between transitive sets. Assuming the axiom of choice this is equivalent to measurability, but it is well-known that choice is necessary for the equivalence. Oddly enough, this central notion was never investigated on its own before. We prove a technical criterion for lifting elementary embeddings to symmetric extensions, and we use this to show that it is consistent relative to a supercompact cardinal that there is a critical cardinal whose successor is singular.
We prove some general theorems for preserving Dependent Choice when taking symmetric extensions, some of which are unwritten folklore results. We apply these to various constructions to obtain various simple consistency proofs.
The notion of a symmetric extension extends the usual notion of forcing by identifying a particular class of names which forms an intermediate model of ZF between the ground model and the generic extension, and often the axiom of choice fails in these models. Symmetric extensions are generally used to prove choiceless consistency results. We develop a framework for iterating symmetric extensions in order to construct new models of ZF. We show how to obtain some well-known and lesser-known results using this framework. Specifically, we discuss Kinna--Wagner principles and obtain some results related to their failure.
We study some limitations and possible occurrences of uniform ultrafilters on ordinals without the axiom of choice. We prove an Easton-like theorem about the possible spectrum of successors of regular cardinals which carry uniform ultrafilters; we also show that this spectrum is not necessarily closed.
We construct a model $M$ of ZF which lies between $L$ and $L[c]$ for a Cohen real $c$ and does not have the form $L(x)$ for any set $x$. This is loosely based on the unwritten work done in a Bristol workshop about Woodin's HOD Conjecture in 2011. The construction given here allows for a finer analysis of the needed assumptions on the ground models, thus taking us one step closer to understanding models of ZF, and the HOD Conjecture and its relatives. This model also provides a positive answer to a question of Grigorieff about intermediate models of ZF, and we use it to show the failure of Kinna--Wagner Principles in ZF.
We show that it is equiconsistent with $\mathsf{ZF}$ that Fodor's lemma fails everywhere, and furthermore that the club filter on every regular cardinal is not even $σ$-complete. Moreover, these failures can be controlled in a very precise manner.
In this paper we investigate some properties of forcing which can be considered "nice" in the context of singularizing regular cardinals to have an uncountable cofinality. We show that such forcing which changes cofinality of a regular cardinal, cannot be too nice and must cause some "damage" to the structure of cardinals and stationary sets. As a consequence there is no analogue to the Prikry forcing, in terms of "nice" properties, when changing cofinalities to be uncountable.
Jech proved that every partially ordered set can be embedded into the cardinals of some model of $ZF$. We extend this result to show that every partially ordered set can be embedded into the cardinals of some model of $ZF+DC_{<κ}$ for any regular $κ$. We use this theorem to show that for all $κ$, the assumption of $DC_κ$ does not entail that there are no decreasing chains of cardinals. We also show how to extend the result to and embed into the cardinals a proper class which is definable over the ground model. We use this extension to give a large cardinals-free proof of independence of the weak choice principle known as $WISC$.
We study a well-known technique of using absoluteness for giving choice-free proofs to some statements which are known to be provable with the axiom of choice. The idea is to reduce the problem to an inner model where the axiom of choice holds and use absoluteness. We examine the complexity of the sentences that this technique can be applied to, and show that many of the theorems in basic partition calculus have the adequate complexity for this technique to apply.