Abstract
Abstract In this paper, we continue the study of a left-distributive algebra of elementary embeddings from the collection of sets of rank less than >. to itself, as well as related finite left-distributive algebras (which can be defined without reference to large cardinals). In particular, we look at the critical points (least ordinals moved) of the elementary embeddings; simple statements about these ordinals can be reformulated as purely algebraic statements concerning the left distributive law. Previously, lower bounds on the number of critical points have been used to show that certain such algebraic statements, known to follow from large cardinals, require more than Primitive Recursive Arithmetic to prove. Here we present the first few steps of a program that, if it can be carried to completion, should give exact computations of the number of critical points, thereby showing that hypotheses only slightly beyond Primitive Recursive Arithmetic would suffice to prove the aforementioned algebraic statements.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
