ON LATTICES EMBEDDABLE INTO LATTICES OF ORDER-CONVEX SETS: CASE OF TREES
М. V. Schwidefsky, Anna Zamojska-Dzienio · International Journal of Algebra and Computation · 2007
We find a syntactic characterization of the class of lattices embeddable into convexity lattices of posets which are trees. The characterization implies that this class forms a finitely based variety.