Large ordinals (Q675870): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Critical points in an algebra of elementary embeddings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Finite left-distributive algebras and embedding algebras / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Homomorphisms of primitive left distributive groupoids / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Elementary embeddings and infinitary combinatorics / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The left distributive law and the freeness of an algebra of elementary embeddings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the algebra of elementary embeddings of a rank into itself / rank | |||
Normal rank |
Revision as of 10:44, 27 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Large ordinals |
scientific article |
Statements
Large ordinals (English)
0 references
6 May 1997
0 references
\(j:(V_\lambda,\in)\longrightarrow(V_\lambda,\in)\) is a non-trivial elementary embedding and \(\kappa\) is its critical point. \(\mathcal A\) is the closure of \(\{j\}\) under \(\cdot\), the multiplication of elementary embeddings introduced by Laver. This multiplication satisfies a left distributive law and Laver proved that \(\mathcal A\) is the free left distributive algebra on one generator. \(\Gamma=\{a(\kappa): a\in{\mathcal A}\}\) is the set of all critical points of all \(a\in{\mathcal A}\). The set \(\Sigma\) of \textit{simple ordinals} is the closure of \(\Gamma\) under the operation \(a''\alpha=\text{sup}\{a(\xi):\xi <\alpha\}\), and \(\Omega\) is the closure of \(\Gamma\) under \(a^-\alpha=\text{min}\{\xi:a(\xi)\geq\alpha\}\) for all \(a\in\mathcal A\). Laver has conjectured that \(\Sigma=\Omega\). The author proves this equality under an assumption on cyclic left distributive algebras called the Threshold Hypothesis (TH). Using TH the author gives a complete description of \(\Omega\). The paper ends with some numerical evidence for TH.
0 references
elementary embedding
0 references
critical point
0 references
left distributive algebra
0 references
simple ordinals
0 references
Threshold Hypothesis
0 references