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.
Counting Finite Linearly Ordered Involutive Bisemilattices / S. Bonzio, M. Pra Baldi, D. Valota (LECTURE NOTES IN COMPUTER SCIENCE). - In: Relational and Algebraic Methods in Computer Science / [a cura di] J. Desharnais, W. Guttmann, S. Joosten. - Prima edizione. - [s.l] : Springer, 2018 Oct 06. - ISBN 9783030021481. - pp. 166-183 (( Intervento presentato al 17. convegno RAMiCS tenutosi a Groningen nel 2018.
Counting Finite Linearly Ordered Involutive Bisemilattices
D. Valota
2018
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.File | Dimensione | Formato | |
---|---|---|---|
Bonzio2018_Chapter_CountingFiniteLinearlyOrderedI.pdf
accesso riservato
Tipologia:
Publisher's version/PDF
Dimensione
429.25 kB
Formato
Adobe PDF
|
429.25 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.