L-Mosaics and Bounded Join-Semilattices in Isabelle/HOL
By: Alessandro Linzi
Potential Business Impact:
AI helps prove math ideas about quantum logic.
We present a complete formalization in Isabelle/HOL of the object part of an equivalence between L-mosaics and bounded join-semilattices, employing an AI-assisted methodology that integrates large language models as reasoning assistants throughout the proof development process. The equivalence was originally established by Cangiotti, Linzi, and Talotti in their study of hypercompositional structures related to orthomodular lattices and quantum logic. Our formalization rigorously verifies the main theoretical result and demonstrates the mutual inverse property of the transformations establishing this equivalence. The development showcases both the mathematical depth of multivalued algebraic operations and the potential for AI-enhanced interactive theorem proving in tackling complex formalization projects.
Similar Papers
A Coalgebraic Model of Quantum Bisimulation
Logic in Computer Science
Makes quantum computers work together safely.
Computational Exploration of Finite Semigroupoids
Formal Languages and Automata Theory
Makes computers understand how to do tasks better.
Computational Exploration of Finite Semigroupoids
Formal Languages and Automata Theory
Makes computers understand how processes work better.