Nimrod Megiddo
Journal of Symbolic Computation
We show that the usual construction of the free distributive lattice on n generators generalizes to an arbitrary quantity of generators and actually yields a free completely distributive lattice. Furthermore, for an infinite number of generators the cardinality of the corresponding free completely distributive lattice is exactly that of the power set of the power set of the set of generators. © 1979 American Mathematical Society.
Nimrod Megiddo
Journal of Symbolic Computation
Ronen Feldman, Martin Charles Golumbic
Ann. Math. Artif. Intell.
Tong Zhang, G.H. Golub, et al.
Linear Algebra and Its Applications
Zhengxin Zhang, Ziv Goldfeld, et al.
Foundations of Computational Mathematics