The agda-unimath library

The Agda Universal Algebra Library (html docs available at the url below)

Algebraic proof discovery in Agda

The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of universal algebra in dependent type theory using the Agda proof assistant language.

First Order Logic Python Library

Small library of concepts in the theory of Constraint Satisfaction Problem and Universal Algebra

Universal algorithm for deterministic resolution of alternating-turn games, based on the Gn/Px/Tz framework and backward induction.

Evolution of Algebraic Terms

The Agda Universal Algebra Library (html docs available at the url below)

Algorithms for generating clones above an algebra that has a majority term.

Repository for global spectrum algorithms

Formalizing the clone theory in type theory and Agda

🦀 Analyze zero-sum games with the Deterministic Solution Algorithm for optimal outcomes, ensuring victory or minimizing loss in complex game scenarios.