University of Cagliari
Counting finite linearly ordered involutive bisemilattices
Bonzio S.;Pra Baldi M.;
2018-01-01
Abstract
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.
Files in This Item:
| File | Size | Format | |
|---|---|---|---|
| Bonzio2018_Chapter_CountingFiniteLinearlyOrderedI.pdf Solo gestori archivio
Type: versione editoriale
Size 429.25 kB
Format Adobe PDF
|
429.25 kB | Adobe PDF | & nbsp; View / Open Request a copy |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.