We introduce an algorithm that computes and counts the duals of finite Gödel-Dummett algebras of k≥1 elements. The computational cost of our algorithm depends on the factorization of k, nevertheless a Python implementation is sufficiently fast to compute the results for very large values of k.
Computing Duals of Finite Gödel Algebras / P. Codara, G. Maurina, D. Valota (ANNALS OF COMPUTER SCIENCE AND INFORMATION SYSTEMS). - In: Proceedings of the 2020 Federated Conference on Computer Science and Information Systems / [a cura di] M. Ganzha, L. Maciaszek, M. Paprzycki. - [s.l] : Polish Information Processing Society, 2020. - ISBN 9788395541674. - pp. 31-34 (( convegno Proceedings of the 2020 Federated Conference on Computer Science and Information Systems tenutosi a Sofia nel 2020 [10.15439/2020F169].
Computing Duals of Finite Gödel Algebras
P. Codara;D. Valota
2020
Abstract
We introduce an algorithm that computes and counts the duals of finite Gödel-Dummett algebras of k≥1 elements. The computational cost of our algorithm depends on the factorization of k, nevertheless a Python implementation is sufficiently fast to compute the results for very large values of k.
| File | Dimensione | Formato | |
|---|---|---|---|
|
CMV-finegodelalgo.pdf
accesso aperto
Tipologia:
Post-print, accepted manuscript ecc. (versione accettata dall'editore)
Dimensione
306.5 kB
Formato
Adobe PDF
|
306.5 kB | Adobe PDF | Visualizza/Apri |
|
169.pdf
accesso aperto
Tipologia:
Publisher's version/PDF
Dimensione
185.14 kB
Formato
Adobe PDF
|
185.14 kB | Adobe PDF | Visualizza/Apri |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
