Compatibility in D-posets (Q1907574): Difference between revisions

A partially ordered set \((P, \leq)\) with the smallest element 0, the greatest element 1, and a binary operation \(-\) is called a Boolean D-poset, if the following properties are satisfied: 1.) \(a-0= a\). 2.) If \(a\leq b\), then \(c- b\leq c- a\). 3.) \((c- a)- b= (c- b)- a\). 4.) \(b- (b- a)=a- (a- b)\). The main result states that any subset \(E\) of a Boolean D-poset \(P\) is compatible, i.e. every finite subset \(F\subset P\) is compatible. This means that there exists a \(\oplus\)-orthogonal system \(G\) such that every element of \(F\) is a sum of a finite number of elements of \(G\). Two elements \(a\), \(b\) are orthogonal if \(a\leq 1-b\) and their sum is defined by \(a\oplus b= 1- ((1- a)- b)\).