arXiv · 1710.03128
Completeness for vector lattices
Abstract
The notion of unboundedly order converges has been recieved recently a particular attention by several authors. The main result of the present paper shows that the notion is efficient and deserves that care. It states that a vector lattice is universally complete if and only if it is unboundedly order complete. Another notion of completeness will be treated is the notion of sup-completion introduced by Donner.
Explore related subjects
Keep this discovery
Youssef Azouzi. 2017-10-09. Completeness for vector lattices. https://arxiv.org/abs/1710.03128
Cite the original work for its findings. Save a collection to share your selection of sources.