Related papers: The first-order definability of generic large card…
We show that the decidability of the first-order theory of the language that combines Boolean algebras of sets of uninterpreted elements with Presburger arithmetic operations. We thereby disprove a recent conjecture that this theory is…
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…
A ccc-generically supercompact cardinal $\kappa$ can be smaller than or equal to the continuum. On the other hand, such a cardinal $\kappa$ still satisfies diverse largeness properties, like that it is a stationary limit of ccc-generically…
We isolate a new large cardinal concept, "remarkability." Consistencywise, remarkable cardinals are between ineffable and omega-Erdos cardinals. They are characterized by the existence of "0^sharp-like" embeddings; however, they relativize…
We introduce (super-$C^{(\infty)}$-)Laver-generic large cardinal axioms for extendibility ((super-$C^{(\infty)}$-)LgLCAs for extendible, for short), and show that most of the previously known consequences of the…
We introduce the notion of $\mathcal{C}$-system of filters, generalizing the standard definitions of both extenders and towers of normal ideals. This provides a framework to develop the theory of extenders and towers in a more general and…
We show relative to strong hypotheses that patterns of compact cardinals in the universe, where a compact cardinal is one which is either strongly compact or supercompact, can be virtually arbitrary. Specifically, we prove if V is a model…
We show that supercompactness and strong compactness can be equivalent even as properties of pairs of regular cardinals. Specifically, we show that if V models ZFC + GCH is a given model (which in interesting cases contains instances of…
We show that if the weak compactness of a cardinal is made indestructible by means of any preparatory forcing of a certain general type, including any forcing naively resembling the Laver preparation, then the cardinal was originally…
Set-theoretic axioms formulated in terms of existence of a Laver-generic large cardinal were introduced in [16] and studied further in [17], [18], [20]. These axioms, let us call them Laver-genericity axioms, claim the existence of a…
We introduce the notions of definable amenability and extreme definable amenability for groups in continuous structures and conduct an extensive analysis of them, drawing parallels with the classical first-order case. We characterize both…
The relationship between the large cardinal notions of strong compactness and supercompactness cannot be determined under the standard ZFC axioms of set theory. Under a hypothesis called the Ultrapower Axiom, we prove that the notions are…
In this paper, we study the notion of a generically extendible cardinal, which is a generic version of an extendible cardinal. We prove that the generic extendibility of $\omega_1$ or $\omega_2$ has small consistency strength, but that of a…
Let omega be the first infinite ordinal (or the set of all natural numbers) with the usual order <. In section 1 we show that, assuming the consistency of a supercompact cardinal, there may exist an ultrapower of omega, whose cardinality is…
We characterize several large cardinal notions by model-theoretic properties of extensions of first-order logic. We show that $\Pi_n$-strong cardinals, and, as a corollary, ``Ord is Woodin" and weak Vop\v{e}nka's Principle, are…
We construct a variety of inner models exhibiting features usually obtained by forcing over universes with large cardinals. For example, if there is a supercompact cardinal, then there is an inner model with a Laver indestructible…
Exacting and ultraexacting cardinals are large cardinal numbers compatible with the Zermelo-Fraenkel axioms of set theory, including the Axiom of Choice. In contrast with standard large cardinal notions, their existence implies that the…
We to a large extent sort out when does a (first order complete theory) T have a superlimit model in a cardinal lambda . Also we deal with relation notions of being limit.
We prove from suitable large cardinal hypotheses that the least weakly compact cardinal can be unfoldable, weakly measurable and even nearly $\theta$-supercompact, for any desired $\theta$. In addition, we prove several global results…
We analyze the notion of guessing model, a way to assign combinatorial properties to arbitrary regular cardinals. Guessing models can be used, in combination with inaccessibility, to characterize various large cardinals axioms, ranging from…