Luca Carai, Tommaso Moraschini
Published 2024-09-05Version 1
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 pseudocomplemented distributive lattices that can be embedded into the free algebra is also obtained.
Dynamic Probability Logics: Axiomatization & Definability
Axiomatizability of hereditary classes of structures of finite and infinite languages and decidability of their universal theories
Some problems with two axiomatizations of discussive logic
![QR code for arXiv:2409.03640 [math.LO]](http://oss.arxitics.com/images/favicon.svg)