Laver tables and large cardinals

Laver tables are finite mathematical structures defined by simple rules. Despite their apparent simplicity, their origins lie in the study of set theory, one of the most abstract and foundational branches of mathematics, particularly in the theory of large cardinals, which represent very strong forms of the axiom of infinity. These structures were first introduced in the 1980s by Richard Laver within this framework and exhibit intriguing connections to other areas of mathematics such as algebra, topology, and cryptography. This project aims to investigate Laver tables from both theoretical and computational perspectives. On the theoretical side, the research will focus on the relationship between these tables and the limits of provability within foundational mathematical systems. Specifically, the project seeks to demonstrate that certain properties of Laver tables cannot be established without assuming robust foundational axioms. This line of inquiry will contribute to a deeper understanding of the strengths and limitations inherent in various logical frameworks. From a computational standpoint, the project will employ high-performance computing resources to generate and analyze larger Laver tables than those previously studied. These computational experiments are expected to uncover patterns, structures, or behaviors that are not readily accessible through theoretical analysis alone. By integrating theoretical insight with empirical investigation, the project aspires to advance knowledge of these complex mathematical objects. Additionally, the research will explore new generalizations of Laver tables, such as modifying their defining rules or incorporating multiple generators. These extensions might lead to new types of mathematical structures with their own interesting properties, as well as provide deeper insight into how such systems work. The interdisciplinary nature of this research, which intersects mathematical logic, algebra, combinatorics, and computer science, positions it to address fundamental and open problems in set theory, potentially yielding groundbreaking contributions to the field. The project will be led by researcher M. Iannella, who already has experience in set theory, combinatorics, and large cardinals, supported by mentor J.P. Aguilera, whose background in mathematical logic will be instrumental to the projects success.

No additional funding sources recorded.