A generalization of distributive ideals to convex sublattices (Q1087893)

The authors give a generalization of standard sublattices [see \textit{E. Fried} and the reviewer, Algebra Univers. 5, 203-211 (1975; Zbl 0322.06008)]. A convex sublattice S is called a D-sublattice iff the congruence relation \({\mathcal H}[S]\) generated by S can be described as follows: (x,y)\(\in {\mathcal H}[S]\) iff there exists a sequence \(x\vee y=z_ 1\geq z_ 2\geq...\geq z_ n=x\wedge y\) and for each i there exist \(a_ i,b_ i\in S\), \(a_ i\geq b_ i\) such that either \(z_{i+1}=z_ i\wedge (z_{i+1}\vee b_ i)\) and \(z_ i=z_ i\wedge (z_{i+1}\wedge a_ i)\) or the dual conditions hold. An ideal I is distributive iff it is a D-sublattice. A convex sublattice S of a lattice is called an M- sublattice iff it satisfies the following condition and its dual condition: for x,y\(\in L\), a,b\(\in S\) with \(y=x\wedge (y\vee b)\) and \(x\vee a=y\vee a\) imply \(x=y\vee (x\wedge a)\) for some \(a\in S\). A convex sublattice is standard iff it is a D-sublattice and an M-sublattice.