Abstract
Laver introduced a family of finite left self-distributive algebras which he used to approximate the algebra generated by a rank-to-rank elementary embedding. This article will demonstrate how to unambiguously evaluate randomly generated, potentially infinite terms in these finite algebras. Here random generation refers to the Galton-Watson process associated to a probability 0<p<1.
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.
