Implication semilattice of 990 quasigroup equational laws

Abstract: In his quest to disprove a claim by Peirce that all lattices are distributive, Ernst Schröder considered 135 years ago a list of 990 equational laws on quasigroups, analogous to associativity, such as $(x // y) * z = (y // x) \backslash\backslash z$. A quasigroup is a non-associative analogue of groups, specifically a set equipped with multiplication and right/left conjugate-division operations that are compatible. Each equation of interest identifies two three-variable expressions built from these operations. I determine all $114$ equivalence classes of their conjunctions, and all implications between them. This includes as a small corner the five-element non-distributive lattice identified by Schröder.

• The paper presents an exhaustive classification of 990 quasigroup laws into precisely 114 inequivalent varieties, forming an implication semilattice.
• The paper employs automated theorem proving (Prover9) and finite model finding (Mace4) orchestrated with Python to compute logical implications and construct finite countermodels.
• The study demonstrates that classical quasigroup varieties inherently form complex, non-distributive lattice structures that bridge historic algebraic challenges with modern computational techniques.

Implication Semilattice Structure Within Quasigroup Equational Laws

Overview

The paper investigates the logical structure induced by the set of 990 three-variable quasigroup equational laws originally considered by Schröder, in his historical effort to challenge distributivity in lattice theory. By exhaustively computing logical implications and equivalence classes among these laws (in the context of quasigroup operations $*, /, \backslash$), a full implication semilattice is constructed. This work completes Schröder’s unfinished 19th-century program and places his five-element non-distributive lattice as a proper substructure within a comprehensive classification of quasigroup varieties generated by these equations.

Methodology

The analysis is performed via systematic automated reasoning, employing McCune’s Prover9 as an automated theorem prover (ATP) and Mace4 as a finite model finder. Python scripts orchestrate calls to these tools for implication checking among the 990 laws and their logical combinations. A Cayley-table-based implementation encodes all possible equation instances, considering all variable permutations and the operational symmetries.

Logical consequences are computed in the lattice-theoretic sense: the sum $A+B$ of two sets of laws $A$ and $B$ is their logical closure (intersection of varieties), and the product $AB$ is the set-theoretic intersection. The primary objects of study are the logically closed (“good”) subsets under implication, which correspond to varieties in the universal algebraic sense. The closure under implication is key: two equations or sets of equations are considered equivalent if their logical closures coincide within the set of 990 laws.

Key Results

The main outcomes are as follows:

• There are exactly 114 inequivalent (logically closed) varieties among the $2^{990}$ possible subsets of equations. These range from the trivial variety of all quasigroups ($V(\emptyset)$), through classes definable by one, two, three, or four equations.
• The 990 equations reduce to 47 distinct equivalence classes for single equations. Each class admits a concise algebraic interpretation, e.g., commutativity, left-multiplication commutativity, semisymmetric laws, associativity, or conditions characterizing Boolean groups.
• 50 variety classes require precisely two equations for characterization; their explicit generators are cataloged.
• 15 classes require three equations, and exactly one class requires a minimal basis of four equations.
• The lattice of logical implications, whose elements are these 114 varieties, contains Schröder’s historic five-element non-distributive lattice, but the global structure is highly complex and non-distributive.
• For every non-implication between equations, a finite quasigroup countermodel is constructed and verified computationally—no reliance on infinite structures is necessary for the completeness of the implication lattice.

Theoretical Implications

This work provides a digital, algorithmic resolution to an early foundational problem in general algebra: the classification of varieties generated by small collections of quasigroup laws. In doing so, it bridges the gap between historic algebraic logic (Schröder, Dedekind) and contemporary computational universal algebra.

Some of the equivalence classes directly parallel intimately studied algebraic systems, e.g., groups, commutative and abelian groups, quasigroups with involutive multiplication, etc. More exotic varieties, especially those requiring three or four generators, represent less well-understood algebraic phenomena and invite further classical analysis. The explicit listing of generators for all equivalence classes enables direct construction and analysis of corresponding varieties.

Moreover, the result demonstrates that the lattice of varieties arising from simple quasigroup equational laws inherently contains non-distributive substructures, giving concrete algebraic content to a classical logical assertion.

Computational and Practical Aspects

The methodology, leveraging ATPs and finite model builders, exhibits the efficacy of automated reasoning for high-volume universal algebraic exploration. The approach contrasts with the Equational Theories Project (ETP) for magmas, in which some non-implications required infinite models. Here, the presence of finite countermodels for all non-implications permits full scalability and mechanization.

Supplementary resources provided by the author (scripts and data files enumerating the equations, representatives, classes, implications, and logical closures) substantiate the computational process and enable reproducibility and extension of the results in further research.

Future Directions

The explicit resolution and comprehensive classification achieved in this work allow for several potential research avenues:

• Algebraic characterization: For equivalence classes whose algebraic structure is not yet fully understood, further study may yield new insights or connections to known classes of quasigroups or other algebraic systems.
• Extension to larger or more complex operational signatures (e.g., loops, semigroups of higher rank) may inherit similar algorithmic tractability for implication structures.
• The techniques employed are broadly extensible to other universal algebra queries—particularly those where logical and equational structure interplay is rich and less susceptible to analytic, hand-crafted proofs.

Conclusion

The paper presents an exhaustive, mechanized classification of all logically closed varieties generated by the 990 canonical three-variable quasigroup laws considered by Schröder. The resulting implication semilattice, containing 114 equivalence classes, precisely characterizes the landscape of quasigroup equational implication in this context and subsumes the classic five-element non-distributive lattice. The work exemplifies the power of computational algebraic reasoning and reveals a rich structural taxonomy of equational quasigroup varieties.