The strength of the Grätzer-Schmidt theorem
DOI10.1007/s00153-016-0488-5zbMath1388.03056arXiv1408.2167OpenAlexW2463207955MaRDI QIDQ506962
Richard A. Shore, Paul Kim Long V. Nguyen, Mushfeq Khan, William A. Lampe, Katie Brodhead, Bjørn Kjos-Hanssen, Paul Brodhead
Publication date: 2 February 2017
Published in: Archive for Mathematical Logic, Mathematical Theory and Computational Practice (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1408.2167
congruence latticescomplete latticelattice theorydistributive latticecomputability theoryreverse mathematicscomplete setscompact elementsalgebraic lattice
Complete lattices, completions (06B23) Representation theory of lattices (06B15) Foundations of classical theories (including reverse mathematics) (03B30) Second- and higher-order arithmetic and fragments (03F35) Theory of numerations, effectively presented structures (03D45) Other Turing degree structures (03D28)
Related Items (1)
Cites Work
- The strength of the Grätzer-Schmidt theorem
- Classical recursion theory. The theory of functions and sets of natural numbers
- A new proof of the congruence lattice representation theorem
- On the strength of Ramsey's theorem for pairs
- Local Initial Segments of The Turing Degrees
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The strength of the Grätzer-Schmidt theorem