Table of Contents
Fetching ...

Model-theoretic characterizations of large cardinals (Re)${}^2$visited

Will Boney, Jonathan Osinski

TL;DR

The paper builds a precise bridge between large-cardinal hierarchies and model-theoretic properties of logics beyond first order. It shows that $\Pi_n$-strong cardinals are captured by Henkin-compactness for $\mathbb{L}^{s,n}$, and that weak Vopěnka's Principle aligns with this Henkin-compactness pattern, mirroring VP via a model-theoretic lens. It proves that huge cardinals arise from type-omission compactness in $\mathbb{L}(Q^{\text{WF}})$, and that the compactness number of $\mathbb{L}(I)$ can exceed the first supercompact under suitable forcing, while also equating the compactness of $\mathbb{L}(Q^{\text{WF}},I)$ with $\mathbb{L}(I)$. Finally, it identifies the upward Löwenheim-Skolem-Tarski numbers of $\mathbb{L}^2$ and $\mathbb{L}^{s,n}$ with the first extendible and the first $C^{(n)}$-extendible cardinals, respectively, providing a cohesive, localizable model-theoretic portrait of the VP/WVP landscape.

Abstract

We characterize several large cardinal notions by model-theoretic properties of extensions of first-order logic. We show that $Π_n$-strong cardinals, and, as a corollary, ``Ord is Woodin" and weak Vopěnka's Principle, are characterized by compactness properties involving Henkin models for sort logic. This provides a model-theoretic analogy between Vopěnka's Principle and weak Vopěnka's Principle. We also characterize huge cardinals by compactness for type omission properties of the well-foundedness logic $\mathbb L(Q^{\text{WF}})$, and show that the compactness number of the Härtig quantifier logic $\mathbb L(I)$ can consistently be larger than the first supercompact cardinal. Finally, we show that the upward Löwenheim-Skolem-Tarski number of second-order logic $\mathbb L^2$ and the sort logic $\mathbb L^{s,n}$ are given by the first extendible and $C^{(n)}$-extendible cardinal, respectively.

Model-theoretic characterizations of large cardinals (Re)${}^2$visited

TL;DR

The paper builds a precise bridge between large-cardinal hierarchies and model-theoretic properties of logics beyond first order. It shows that -strong cardinals are captured by Henkin-compactness for , and that weak Vopěnka's Principle aligns with this Henkin-compactness pattern, mirroring VP via a model-theoretic lens. It proves that huge cardinals arise from type-omission compactness in , and that the compactness number of can exceed the first supercompact under suitable forcing, while also equating the compactness of with . Finally, it identifies the upward Löwenheim-Skolem-Tarski numbers of and with the first extendible and the first -extendible cardinals, respectively, providing a cohesive, localizable model-theoretic portrait of the VP/WVP landscape.

Abstract

We characterize several large cardinal notions by model-theoretic properties of extensions of first-order logic. We show that -strong cardinals, and, as a corollary, ``Ord is Woodin" and weak Vopěnka's Principle, are characterized by compactness properties involving Henkin models for sort logic. This provides a model-theoretic analogy between Vopěnka's Principle and weak Vopěnka's Principle. We also characterize huge cardinals by compactness for type omission properties of the well-foundedness logic , and show that the compactness number of the Härtig quantifier logic can consistently be larger than the first supercompact cardinal. Finally, we show that the upward Löwenheim-Skolem-Tarski number of second-order logic and the sort logic are given by the first extendible and -extendible cardinal, respectively.

Paper Structure

This paper contains 8 sections, 13 theorems, 26 equations, 2 figures.

Key Result

Theorem 3.4

The following are equivalent for every cardinal $\kappa$ and $n \geq 2$:

Figures (2)

  • Figure 1: Relations between $\text{WVP}$, $\Pi_n$-strong cardinals, and HCC numbers.
  • Figure 2: Relations between $\text{VP}$, $C^{(n)}$-extendible cardinals, ULST numbers, compactness numbers, LST numbers, and SHC numbers.

Theorems & Definitions (30)

  • Definition 3.3
  • Theorem 3.4
  • proof
  • Lemma 3.5
  • proof
  • Claim 3.6
  • Theorem 3.7
  • Corollary 3.8
  • Definition 4.1
  • Lemma 4.4
  • ...and 20 more