Counting finite linearly ordered involutive bisemilattices
Logic
2021-07-23 v1 Combinatorics
Abstract
The class of involutive bisemilattices plays the role of the algebraic counterpart of paraconsistent weak Kleene logic. Involutive bisemilattices can be represented as Plonka sums of Boolean algebras, that is semilattice direct systems of Boolean algebras. In this paper we exploit the Plonka sum representation with the aim of counting, up to isomorphism, finite involutive bisemilattices whose direct system is given by totally ordered semilattices.
Keywords
Cite
@article{arxiv.2107.10540,
title = {Counting finite linearly ordered involutive bisemilattices},
author = {Stefano Bonzio and Michele Pra Baldi and Diego Valota},
journal= {arXiv preprint arXiv:2107.10540},
year = {2021}
}