On the universal theory of the free pseudocomplemented distributive lattice
Abstract
It is shown that the universal theory of the free pseudocomplemented distributive lattice is decidable and a recursive axiomatization is presented. This contrasts with the case of the full elementary theory of the finitely generated free algebras which is known to be undecidable. As a by-product, a description of the finitely generated pseudocomplemented distributive lattices that can be embedded into the free algebra is also obtained.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.