Counting finite linearly ordered involutive bisemilattices. (English) Zbl 1522.06003
Desharnais, Jules (ed.) et al., Relational and algebraic methods in computer science. 17th international conference, RAMiCS 2018, Groningen, The Netherlands, October 29 – November 1, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11194, 166-183 (2018).
Summary: The class of involutive bisemilattices plays the role of the algebraic counterpart of paraconsistent weak Kleene logic. Involutive bisemilattices can be represented as Płonka sums of Boolean algebras, that is semilattice direct systems of Boolean algebras. In this paper we exploit the Płonka sum representation with the aim of counting, up to isomorphism, finite involutive bisemilattices whose direct system is given by totally ordered semilattices.
For the entire collection see [Zbl 1398.68023].
For the entire collection see [Zbl 1398.68023].
