Abstract
Prohibiting a combinatorial tree in the Priestley duals determines an axomatizable class of distributive lattices. On the other hand, prohibiting n-crowns with n at least 3 does not.
Given what is known about the diamond, this is another strong indication that this fact characterizes combinatorial trees. We also discuss varieties of 2-Heyting algebras in this context.