Computing Duals of Finite Gödel Algebras

We introduce an algorithm that computes and counts the duals of finite G\"odel-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.

---

1. Track 1: Artificial Intelligence

---

2. Technical Session: 15th International Symposium Advances in Artificial Intelligence and Applications

---

3. Opracowanie rekordu ze środków MNiSW, umowa Nr 461252 w ramach programu "Społeczna odpowiedzialność nauki" - moduł: Popularyzacja nauki i promocja sportu (2021).