Sias Giuliana
UniCa About Professors and Researchers Giuliana Sias Research Research outcomes (IRIS)

Giuliana Sias

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.
2018
Inglese
Relational and Algebraic Methods in Computer Science. 17th International Conference, RAMiCS 2018, Groningen, The Netherlands, October 29 – November 1, 2018, Proceedings
LECTURE NOTES IN COMPUTER SCIENCE
Manuel Bodirsky, et al.
Jules Desharnais, Walter Guttmann, Stef Joosten
11194
166
183
18
Springer
Cham
978-3-030-02148-1
WOS:000728359800011
2-s2.0-85055768870
Esperti anonimi
scientifica
Finite involutive bisemilattices; Płonka sums; Weak Kleene logic
no
info:eu-repo/semantics/bookPart
2.1 Contributo in volume (Capitolo o Saggio)
Bonzio, S.; Pra Baldi, M.; Valota, D.
2 Contributo in Volume::2.1 Contributo in volume (Capitolo o Saggio)
3
268
reserved
Files in This Item:
File Size Format  
Bonzio2018_Chapter_CountingFiniteLinearlyOrderedI.pdf

Solo gestori archivio

Type: versione editoriale
Size 429.25 kB
Format Adobe PDF
& nbsp; View / Open   Request a copy
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.

Questionnaire and social

Share on:
Impostazioni cookie