Document Type

Article

Publication Date

10-3-2016

Abstract

Right-residuated binars and right-divisible residuated binars are defined as precursors of generalized hoops, followed by some results and open problems about these partially ordered algebras. Next we show that all complete homomorphic images of a complete residuated lattice A can be constructed easily on certain definable subsets of A. Applying these observations to the algebras of Hajek’s basic logic (BL-algebras), we give an effective description of the HS-poset of finite subdirectly irreducible BL-algebras. The lattice of finitely generated BL-varieties can be obtained from this HS-poset by constructing the lattice of downward closed sets. These results are extended to bounded generalized BL-algebras using poset products and the duality between complete perfect Heyting algebras and partially ordered sets. We also prove that the number of finite generalized BL-algebras with n join-irreducible elements is, up to isomorphism, the same as the number of preorders on an n-element set, hence the same as the number of closure algebras (i.e., S4-modal algebras) with 2n" style="position: relative;" tabindex="0" id="MathJax-Element-1-Frame">2n elements. This result gives rise to a faithful functor from the category of finite GBL-algebras to the category of finite closure algebras that is full on objects, providing a novel connection between some substructural logics and classical modal logic. Finally, we show how generic satisfaction modulo theories solvers (SMT-solvers) can be used to obtain practical decision procedures for propositional basic logic and many of its

Comments

NOTICE: this is the author’s earlier version of a work that was accepted for publication in Soft Computing. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms, may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Soft Computing, volume 21, issue 1, in 2017. DOI: 10.1007/s00500-016-2345-1

The Creative Commons license below applies only to this version of the article.

Peer Reviewed

1

Copyright

Elsevier

Creative Commons License

Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.

Available for download on Tuesday, October 03, 2017

Share

COinS