Boolean [0, 1]-valued continuous operators
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\).
- Boolean algebraic structure on [0,1]
- Boolean-valued analysis of order-bounded operators
- scientific article; zbMATH DE number 4155226
- Boolean-rank-preserving operators and Boolean-rank-1 spaces
- Boolean operations over measure algebras
- scientific article; zbMATH DE number 66911
- \([0,1]\)-valued logic: A natural generalization of Boolean logic
- Boolean Sums of Operators and Projection Constants
- Order-continuous functionals in Boolean-valued models of set theory
- Approximate continuity and topological Boolean algebras
This page was built for publication: Boolean [0, 1]-valued continuous operators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4392897)
