Let J be a fixed partially ordered set (poset). Among all posets in which J is join-dense and consists of all completely join-irreducible elements, there is an up to isomorphism unique greatest one, the Alexandroff completion L. Moreover, the class of all such posets has a canonical set of representatives, C 0 L, consisting of those sets between J and L which intersect each of the intervals I j =[j ∨,j ∨] (j∈J), where j ∨ and j ∨ denote the greatest element of L less than, respectively, not greater than j. The complete lattices in C 0 L form a closure system C ∞ L, consisting of all Dedekind–MacNeille completions of posets in C 0 L. We describe explicitly those L for which C 0 L, respectively, C ∞ L is a (complete atomic) Boolean lattice, and similarly, those for which C ∞ L is distributive (or modular). Analogous results are obtained for C κ L, the closure system of all posets in C 0 L that are closed under meets of less than κ elements (where κ is any cardinal number).