2024/09/05 by Luca Carai, Tommaso Moraschini, Carai, Luca +1
Computer Science · #Advanced Algebra and Logic #FOS: Mathematics #Logic (math.LO) #Logic, Reasoning, and Knowledge #Rough Sets and Fuzzy Logic
paper · pdf · doi:10.48550/arxiv.2409.03640
openalex publication_date 2024/09/05 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/30
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.