Hostname: page-component-89b8bd64d-ktprf Total loading time: 0 Render date: 2026-05-09T23:09:08.705Z Has data issue: false hasContentIssue false

VERY LARGE SET AXIOMS OVER CONSTRUCTIVE SET THEORIES

Part of: Set theory

Published online by Cambridge University Press:  26 February 2024

HANUL JEON
Affiliation:
DEPARTMENT OF MATHEMATICS CORNELL UNIVERSITY ITHACA, NY 14853, USA E-mail: hj344@cornell.edu URL: https://hanuljeon95.github.io
RICHARD MATTHEWS
Affiliation:
LABORATOIRE D’ALGORITHMIQUE, COMPLEXITÉ ET LOGIQUE UNIVERSITÉ PARIS-EST CRÉTEIL CRÉTEIL F-94010, FRANCE E-mail: richard.matthews@u-pec.fr URL: https://richardmatthewslogic.github.io/

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 $\Delta _0$-formulas, which we will denote by $\Delta _0\text {-}\mathsf {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.

Information

Type
Article
Copyright
© The Author(s), 2024. Published by Cambridge University Press on behalf of The Association for Symbolic Logic

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable