Completeness for vector lattices (Q2414746): Difference between revisions

\textit{H. Li} and \textit{Z.-L. Chen} proved that a vector lattice \(X\), having the countable \(\sup\) property, is universally complete if it is \(uo\)-complete [Positivity 22, No. 1, 83--90 (2018; Zbl 1397.46002)]. The author shows that this remains true without any assumption on \(X\).