Elementary Embeddings and Algebra
This chapter describes algebraic consequences of the existence of a non-trivial elementary embedding of V λ into itself (Axiom I3). In addition to composition, the family of all elementary embeddings of the considered structure V λ is equipped with a second binary operation essentially consisting in applying one embedding to another one. This operation satisfies the self-distributivity law x(yz)=(xy)(xz) and, if j is a non-trivial elementary embedding as above, the closure of j under application is a free self-distributive system. Moreover, identifying embeddings that coincide up to some level leads to a sequence of finite quotients, the Laver tables. The main applications obtained so far are a solution to the Word Problem of the self-distributivity law, and a proof that the periods in Laver tables go to infinity with the size. Alternative approaches avoiding elementary embeddings have been found in the first case, but the question of whether a large cardinal hypothesis is necessary remains open in the second.
KeywordsWord Problem Braid Group Order Type Elementary Embedding Primitive Recursive Function
Unable to display preview. Download preview PDF.
- Patrick Dehornoy, Ivan Dynnikov, Dale Rolfsen, and Bert Wiest. Why are Braids Orderable? volume 14 of Panoramas et Synthèses. Société Mathématique de France, Paris, 2002. Google Scholar
- Randall Dougherty. Critical points in an algebra of elementary embeddings (II). In Wilfrid Hodges, editor, Logic: From Foundations to Applications, pages 103–136. Academic Press, San Diego, 1996. Google Scholar
- Richard Laver. Elementary embeddings of a rank into itself. Abstracts of the American Mathematical Society, 7:6, 1986. Google Scholar