Computing Duals of Finite Gödel Algebras

We introduce an algorithm that computes and counts the duals of finite Godel-Dummett algebras of $k\geq 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.