Boolean-linear spaces (Q802637)

Starting from partially ordered sets, the author introduces Boolean- linear spaces. Examples of such spaces are linear orderings and products of linear orderings, Boolean algebras, various function spaces, vector lattices and lattice-ordered groups. The key definition in formulating the concept of Boolean-linear spaces is that of ``p forces \(f<g''\). Then a Boolean-linear space is a partially ordered set which satisfies the axiom stating that for all f and g, either \(f\leq g\) or else some p forces \(g<f.\) There is a formal similarity between the concept of forcing introduced here and that of forcing in set theory. So the machinery of Boolean- valued models can be used. It is shown that the Stone representation theorem can be generalized for Boolean-linear spaces. Further on it is shown that every Boolean-linear space has a unique completion and is endowed with the concept of convergence. Finally the author introduces the concept of spectra. He shows that for spaces which have a spectrum the spectral theorem can be proved.