D-lattices (Q1907552): Difference between revisions

A \(D\)-poset [\textit{F. Chovanec} and \textit{F. Kôpka}, Math. Slovaca 44, 21-34 (1994; Zbl 0789.03048)] is a bounded poset \(P\) with a partial binary operation \(\backslash\) such that \(b \backslash a\) is defined iff \(a \leq b\), and for \(a,b,c \in P\), we have (i) if \(a \leq b\), then \(b \backslash a \leq b\) and \(b \backslash (b \backslash a) = a\); (ii) if \(a \leq b \leq c\), then \(c \backslash b \leq c \backslash a\) and \((c \backslash a) \backslash (c \backslash b) = b \backslash a\). If \(P\) is a lattice, then \(P\) is said to be a \(D\)-lattice. Then we can extend the partial operation \(\backslash\) to a (total) binary operation \(\oslash\) via \(b \oslash a = b \backslash (a \wedge b)\). The main result of the paper under review says that a \(D\)-lattice \(P\) can be organized into an MV-algebra iff, for all \(u,v,w \in P\), we have \((w \oslash u) \oslash v = (w \oslash v) \oslash u\).