The Strength of the Gr\"atzer-Schmidt Theorem
Abstract
The Gr\"atzer-Schmidt theorem of lattice theory states that each algebraic lattice is isomorphic to the congruence lattice of an algebra. We study the reverse mathematics of this theorem. We also show that the set of indices of computable lattices that are complete is 11-complete; the set of indices of computable lattices that are algebraic is 11-complete; the set of compact elements of a computable lattice is 11 and can be 11-complete; and the set of compact elements of a distributive computable lattice is 03, and there is an algebraic distributive computable lattice such that the set of its compact elements is 03-complete.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.