# Birkhoff's Completeness Theorem for Multi-Sorted Algebras Formalized in Agda

@article{Abel2021BirkhoffsCT, title={Birkhoff's Completeness Theorem for Multi-Sorted Algebras Formalized in Agda}, author={Andreas Abel}, journal={ArXiv}, year={2021}, volume={abs/2111.07936} }

This document provides a formal proof of Birkhoff’s completeness theorem for multi-sorted algebras which states that any equational entailment valid in all models is also provable in the equational theory. More precisely, if a certain equation is valid in all models that validate a fixed set of equations, then this equation is derivable from that set using the proof rules for a congruence. The proof has been formalized in Agda version 2.6.2 with the Agda Standard Library version 1.7 and this…

## One Citation

### A Machine-Checked Proof of Birkhoff's Variety Theorem in Martin-Löf Type Theory

- Computer Science, MathematicsTYPES
- 2021

This paper presents a self-contained, formal, constructive proof of Birkhoff’s HSP theorem in Martin-Löf dependent type theory, to demonstrate the expressive power of inductive and dependent types for representing and reasoning about general algebraic and relational structures by using them to formalize a significant theorem in the field.

## References

SHOWING 1-7 OF 7 REFERENCES

### Formalization of Universal Algebra in Agda

- Mathematics, Computer ScienceLSFA
- 2017

### The Agda Universal Algebra Library and Birkhoff's Theorem in Martin-Löf Dependent Type Theory

- MathematicsArXiv
- 2021

### Universal Algebra in UniMath

- MathematicsArXiv
- 2020

The aim is to develop a general framework for formalizing and studying Universal Algebra in a proof assistant and Univalent Mathematics seems to provide a suitable environment to carry on the endeavour.

### On the Structure of Abstract Algebras

- Mathematics
- 1935

The following paper is a study of abstract algebras qua abstract algebras. As no vocabulary suitable for this purpose is current, I have been forced to use a number of new terms, and extend the…

### Indexed Containers

- Mathematics2009 24th Annual IEEE Symposium on Logic In Computer Science
- 2009

We show that the syntactically rich notion of inductive families can be reduced to a core type theory with a fixed number of type constructors exploiting the novel notion of indexed containers.…

### 12 th Workshop on Logical and Semantic Frameworks , with Applications , LSFA 2017 , Brasília , Brazil , September 23 - 24 , 2017 , volume 338 of Electr

- Notes in Theor . Comp . Sci .

### Universal algebra in HoTT

- 25th International Conference on Types for Proofs and Programs,
- 2019