The Strength of the Grätzer-Schmidt Theorem
Abstract
The Grätzer-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 $\Pi^1_1$-complete; the set of indices of computable lattices that are algebraic is $\Pi^1_1$-complete; the set of compact elements of a computable lattice is $\Pi^{1}_{1}$ and can be $\Pi^1_1$-complete; and the set of compact elements of a distributive computable lattice is $\Pi^{0}_{3}$, and there is an algebraic distributive computable lattice such that the set of its compact elements is $\Pi^0_3$-complete.
- Publication:
-
arXiv e-prints
- Pub Date:
- August 2014
- DOI:
- 10.48550/arXiv.1408.2167
- arXiv:
- arXiv:1408.2167
- Bibcode:
- 2014arXiv1408.2167B
- Keywords:
-
- Mathematics - Logic;
- 03D
- E-Print:
- This journal version replaces the conference version (Computability in Europe, Lecture Notes in Computer Science 5635 (2009), 59--67)