Boolean [0, 1]-valued continuous operators (Q4392897)

The main theorem is: Given a Boolean algebra \((K,\wedge, \vee, \neg)\), then there is a \([0,1]\)-valued assignment nontrivial function \(\tau\) \((\tau(K)\neq \{0,1\})\) and continuous operators *, \(\perp\), \(\#\) on \([0,1]\) such that \(\tau(a\wedge b)= \tau(a)^* \tau(b)\), \(\tau(a\vee b)= \tau(a)\perp \tau(b)\), \(\tau(\neg a)=\neg \#\tau(a)\). It follows that while it is true that \([0,1]\) in its natural ordering has no Boolean structure, it is false that the only case of Boolean valuations is the trivial one \(\{0,1\}\). The author makes an in-depth study of the errors in the published proofs of the latter statement and he points out that his theorem allows one to form Boolean valuations that mimic the ordering of reals on \([0,1]\) up to a maximal error of \(\varepsilon\) for any \(\varepsilon>0\).