The wholeness axiom and Laver sequences
The ``Wholeness Axiom WA discussed in the paper is formalized in the language \(\{\in,{\mathbf j}\}\) where \({\mathbf j}\) is a unary function symbol. It consists of the followng axioms: (1) \(\exists x({\mathbf j}(x)\neq x)\), (2) For every formula \(\varphi(x_1,\dots, x_m)\) in the language \(\{\in\}\), \[ \forall x_1,\dots, x_m(\varphi(x_1,\dots, x_m)\leftrightarrow \varphi({\mathbf j}(x_1),\dots,{\mathbf j}(x_m))), \] (3) Each instance of the usual Separation scheme involving a formula \(\psi\) in the language \(\{\in,{\mathbf j}\}\). These axioms assert that \({\mathbf j}\) is a nontrivial elementary embedding from the universe into itself and that Separation holds for formulas with occurrences of \({\mathbf j}\). It is shown that \(\text{ZFC}+ \text{WA}\) has consistency strength strictly between \(I_3\) and the existence of a cardinal that is super-\(n\) huge for every \(n\). (By a result of \textit{K. Kunen} [J. Symb. Log. 36, 407-413 (1971; Zbl 0272.02087)], the stronger theory obtained by asking that Replacement holds for formulas with occurrences of \({\mathbf j}\) is inconsistent.) \(\text{ZFC}+ \text{WA}\) is used as a starting point for studying generalizations of Laver sequences (a Laver sequence at an infinite cardinal \(\kappa\) is a function \(f:\kappa\to V_\kappa\) with the property that for every set \(x\) an every \(\lambda\geq \max(\kappa,|\text{TC}(x)|)\) there is a normal ultrafilter \(U\) on \(P_\kappa(\lambda)\) such that \(x= i_U(f)(\kappa)\), where \(i_U\) is the canonical embedding determined by \(U\)). For example, it is shown that if WA holds and \(\kappa\) is the critical point of the WA-embedding \(j: V\to V\), then there is a Laver sequence \(f\) at \(\kappa\) with the following property: there exist \(\lambda\), \(U\) such that \(\lambda>\kappa\) and \(U\) is a normal ultrafilter on \(P_\kappa(\lambda)\), \(|\text{TC}(i_U(f)(\kappa))|\leq \lambda\) and if \(D\) is the normal ultrafilter on \(\kappa\) derived from \(i_U\), then, for each \(g:\kappa\to \kappa\) definable in \(V_\kappa\) (with parameters), the function \(\alpha\mapsto|f(\alpha)|\) dominates \(g\) on a set in \(D\). The existence of such a sequence is consistency-wise much stronger than supercompactness (it implies that there is a model of set theory with a proper class of extendibles). More generally, the paper is concerned with the problem of determining which large cardinals admit their own brand of Laver sequences and under what large cardinal assumptions these sequences can be built.
- A Proof of Projective Determinacy
- Between strong and superstrong
- Consistency of \(V= \text{HOD}\) with the wholeness axiom
- Elementary embeddings and infinitary combinatorics
- Exact functors and measurable cardinals
- Flipping properties and huge cardinals
- Fragile measurability
- How large is the first strongly compact cardinal? or a study on identity crises
- scientific article; zbMATH DE number 3829897 (Why is no real title available?)
- scientific article; zbMATH DE number 3861143 (Why is no real title available?)
- scientific article; zbMATH DE number 3652325 (Why is no real title available?)
- scientific article; zbMATH DE number 3508498 (Why is no real title available?)
- scientific article; zbMATH DE number 3591984 (Why is no real title available?)
- scientific article; zbMATH DE number 3367099 (Why is no real title available?)
- Laver sequences for extendible and super-almost-huge cardinals
- Making the hugeness of ϰ resurrectable after ϰ-directed closed forcing
- Making the supercompactness of \(\nu\) indestructible under \(\nu\)-directed closed forcing
- Many-times huge and superhuge cardinals
- Model theory
- On certain indestructibility of strong cardinals and a question of Hajnal
- Set theory. An introduction to independence proofs
- Set theory. An introduction to large cardinals
- Sets constructible from sequences of ultrafilters
- Strong axioms of infinity and elementary embeddings
- The wholeness axioms and V=HOD
- Undefinable Classes and Definable Elements in Models of Set Theory and Arithmetic
- Consistency of \(V= \text{HOD}\) with the wholeness axiom
- The lottery preparation
- I0 and rank-into-rank axioms
- The spectrum of elementary embeddings \(j: V \to V\)
- Rank-into-rank hypotheses and the failure of GCH
- A general tool for consistency results related to I1
- Indestructibility, HOD, and the ground axiom
- scientific article; zbMATH DE number 1045794 (Why is no real title available?)
- The gap between I3and the wholeness axiom
- Laver sequences for extendible and super-almost-huge cardinals
- Indestructibility of wholeness
- The axiom of infinity and transformations j: V V
- The wholeness axioms and V=HOD
- Laver and set theory
- On separating wholeness axioms
- Very large set axioms over constructive set theories
- Lifting elementary embeddings \(j : V_{\lambda } \rightarrow V_{\lambda }\)
- Indestructibility properties of remarkable cardinals
This page was built for publication: The wholeness axiom and Laver sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1591376)