Table of Contents
Fetching ...

Very large set axioms over constructive set theories

Hanul Jeon, Richard Matthews

TL;DR

The paper develops a deep integration of large-set axioms into constructive set theories by leveraging elementary embeddings, revealing that even a modest fragment $\Delta_0\text{-}\mathsf{BTEE}_M$ yields strong consistency results surpassing classical second-order arithmetic. It demonstrates that Reinhardt-type and stronger notions (including super Reinhardt and totally Reinhardt) push the constructive strength beyond $\,\mathsf{ZF}$ with choiceless large cardinals, and it develops two-second-order constructive theories $\mathsf{CGB}$ and $\mathsf{IGB}$ to formalize these notions. A key methodological contribution is the use of Gambino’s Heyting-valued interpretation and the double-negation topology to relate constructive and classical theories, enabling the extraction of lower bounds and translation-based conservativity results. The work connects internal strength analyses with external interpretability results and to a broader program of aligning constructive set theories with classical large-cardinal hierarchies, while outlining substantial avenues for future refinement and expansion. Overall, the paper provides foundational tools and results indicating that large-set axioms in a constructive setting can reach consistency strengths comparable to substantial classical large-cardinal frameworks, through carefully crafted embedding-based formulations and second-order mechanisms.

Abstract

We investigate large set axioms defined in terms of elementary embeddings over constructive set theories, focusing on $\mathsf{IKP}$ and $\mathsf{CZF}$. Most previously studied large set axioms, notably the constructive analogues of large cardinals below $0^\sharp$, have proof-theoretic strength weaker than full Second-order Arithmetic. On the other hand, the situation is dramatically different for those defined via elementary embeddings. We show that by adding to $\mathsf{IKP}$ the basic properties of an elementary embedding $j\colon V\to M$ for $Δ_0$-formulas, which we will denote by $\mathsf{Δ_0\text{-}BTEE}_M$, we obtain the consistency of $\mathsf{ZFC}$ and more. We will also see that the consistency strength of a Reinhardt set exceeds that of $\mathsf{ZF+WA}$. Furthermore, we will define super Reinhardt sets and $\mathsf{TR}$, which is a constructive analogue of $V$ being totally Reinhardt, and prove that their proof-theoretic strength exceeds that of $\mathsf{ZF}$ with choiceless large cardinals.

Very large set axioms over constructive set theories

TL;DR

The paper develops a deep integration of large-set axioms into constructive set theories by leveraging elementary embeddings, revealing that even a modest fragment yields strong consistency results surpassing classical second-order arithmetic. It demonstrates that Reinhardt-type and stronger notions (including super Reinhardt and totally Reinhardt) push the constructive strength beyond with choiceless large cardinals, and it develops two-second-order constructive theories and to formalize these notions. A key methodological contribution is the use of Gambino’s Heyting-valued interpretation and the double-negation topology to relate constructive and classical theories, enabling the extraction of lower bounds and translation-based conservativity results. The work connects internal strength analyses with external interpretability results and to a broader program of aligning constructive set theories with classical large-cardinal hierarchies, while outlining substantial avenues for future refinement and expansion. Overall, the paper provides foundational tools and results indicating that large-set axioms in a constructive setting can reach consistency strengths comparable to substantial classical large-cardinal frameworks, through carefully crafted embedding-based formulations and second-order mechanisms.

Abstract

We investigate large set axioms defined in terms of elementary embeddings over constructive set theories, focusing on and . Most previously studied large set axioms, notably the constructive analogues of large cardinals below , have proof-theoretic strength weaker than full Second-order Arithmetic. On the other hand, the situation is dramatically different for those defined via elementary embeddings. We show that by adding to the basic properties of an elementary embedding for -formulas, which we will denote by , we obtain the consistency of and more. We will also see that the consistency strength of a Reinhardt set exceeds that of . Furthermore, we will define super Reinhardt sets and , which is a constructive analogue of being totally Reinhardt, and prove that their proof-theoretic strength exceeds that of with choiceless large cardinals.
Paper Structure (36 sections, 94 theorems, 73 equations, 2 figures)

This paper contains 36 sections, 94 theorems, 73 equations, 2 figures.

Key Result

Theorem 1.1

∎ These two theories are equiconsistent over $\mathsf{ZF+DC}$:

Figures (2)

  • Figure 1: Notions appearing in this paper
  • Figure 2: Theories appearing in this paper

Theorems & Definitions (209)

  • Theorem 1.1: Goldberg Goldberg2021EvenOrdinals
  • Theorem 1.2: Goldberg Goldberg2021EvenOrdinals
  • Theorem 1.3: MatthwesPhD
  • Theorem 1.4: MatthwesPhD or Matthews2020
  • Theorem 1.5: MatthwesPhD or Matthews2020
  • Theorem 1.6: ZieglerPhD
  • Theorem 1.7: Ziegler ZieglerPhD
  • Theorem
  • Theorem
  • Theorem
  • ...and 199 more