Strong law of large numbers in D-posets (Q1907570)

A D-poset is a partially ordered set with a greatest and a smallest element and with a partial binary operation \(\setminus\) such that \(b \setminus a\) is defined if and only if \(a\leq b\) and (1) if \(a\leq b\) then \(b\setminus a\leq b\) and \(b\setminus (b\setminus a)= a\), (2) if \(a\leq b\leq c\) then \(c\setminus b\leq c\setminus a\) and \((c\setminus a)\setminus (c\setminus b)= b\setminus a\). The authors prove the strong law of large numbers for observables on D-posets.