Is there a good overview of the dependencies between properties that a (finite) lattice poset can have?
To give a practical example, I was looking for a property weaker than congruence uniform and stronger than semidistributive.
If I am not mistaken, https://graphclasses.org/ answers an analogous question for graphs.