A common generalization of Kelley's theorem (concerning measures on Boolean algebra) and on von Neumann's minimax theorem
Kelley's Theorem is a purely combinatorial characterization of measure algebras. We first apply linear programming to exhibit the duality between measures and this characterization for finite algebras. Then we give a new proof of the Theorem using methods from nonstandard analysis.
It is shown that every monocompact submeasure on an orthomodular poset is order continuous. From this generalization of the classical Marczewski Theorem, several results of commutative Measure Theory are derived and unified.
We show that a σ-algebra 𝔹 carries a strictly positive continuous submeasure if and only if 𝔹 is weakly distributive and it satisfies the σ-finite chain condition of Horn and Tarski.