Related papers: Determinacy and Large Cardinals
The primary goal of this paper is to establish a model of $ZFC$ wherein the definable tree property is affirmed for all uncountable regular cardinals. This endeavor commences with the utilization of both a supercompact cardinal and a…
At the beginning of a dynamic game, players may have exogenous theories about how the opponents are going to play. Suppose that these theories are commonly known. Then, players will refine their first-order beliefs, and challenge their own…
We show that the following two theories are equiconsistent: (T) ZFC, CH and "There is a dense ideal on the first uncountable cardinal such that if j is the generic embedding associated with it then its restriction on ordinals is independent…
We prove several consistency results concerning the notion of $\omega$-strongly measurable cardinal in HOD. In particular, we show that is it consistent, relative to a large cardinal hypothesis weaker than $o(\kappa) = \kappa$, that every…
We give the definition of Woodin for strong compactness cardinals, the Woodinised version of strong compactness, and we prove an analogue of Magidor's identity crisis theorem for the first strongly compact cardinal.
Motivated by results of Bagaria, Magidor and V\"a\"an\"anen, we study characterizations of large cardinal properties through reflection principles for classes of structures. More specifically, we aim to characterize notions from the lower…
In the absence of the Axiom of Choice, the "small" cardinal $\omega_1$ can exhibit properties more usually associated with large cardinals, such as strong compactness and supercompactness. For a local version of strong compactness, we say…
While maximal independent families can be constructed from ZFC via Zorn's lemma, the presence of a maximal $\sigma$-independent family already gives an inner model with a measurable cardinal, and Kunen has shown that from a measurable…
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…
The determinacy of lightface $\Delta^1_{2n+2}$ and boldface $\boldsymbol{\Pi}^1_{2n+1}$ sets implies the existence of an $(\omega, \omega_1)$-iterable $M_{2n+1}^{\#}$.
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 investigate forms of filter extension properties in the two-cardinal setting involving filters on $P_\kappa(\lambda)$. We generalize the filter games introduced by Holy and Schlicht in \cite{HolySchlicht:HierarchyRamseyLikeCardinals} to…
We prove that if there is an elementary embedding from the universe to itself, then there is a proper class of measurable successor cardinals.
We summarize the known methods of producing a non-supercompact strongly compact cardinal and describe some new variants. Our Main Theorem shows how to apply these methods to many cardinals simultaneously and exactly control which cardinals…
We continue the work from [8] and make a small -- but significant -- improvement to the definition of $j$-decomposable system. This provides us with a better lifting of elementary embeddings to symmetric extensions. In particular, this…
The game theoretic concepts of rationalizability and iterated dominance are closely related and provide characterizations of each other. Indeed, the equivalence between them implies that in a two player finite game, the remaining set of…
The Axiom of Full Reflection at a measurable cardinal has been conjectured to be equiconsitent with the existence of a coherent sequence of measures with a repeat point. However we prove that the Axiom of Full Reflection at a measurable…
NF set theory using intuitionistic logic is called iNF. We develop the theories of finite sets and their power sets and mappings, finite cardinals and their ordering, cardinal exponentiation, addition, and multiplication. We follow Rosser…
We present an analogy between cardinal characteristics from set theory and highness properties from computability theory, which specify a sense in which a Turing oracle is computationally strong. While this analogy was first studied…
We recently formulated a new large-cardinal axiom of strength intermediate between a totally indescribable cardinal and an $\omega$-Erd\H{o}s cardinal, positing the existence of what we called an "extremely reflective cardinal", and we…