Computing Duals of Finite Gödel Algebras

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.