2000 character limit reached
Eberlein-Smulian compactness and Kolmogorov extension theorems; a model theoretic approach
Published 10 Sep 2015 in math.LO | (1509.03193v3)
Abstract: This paper has two parts. First, we complete the proof of the Kolmogorov extension theorem for unbounded random variables using compactness theorem of integral logic which was proved for bounded case in [8]. Second, we give a proof of the Eberlein-Smulian compactness theorem by Ramsey's theorem and point out the correspondence between this theorem and a result in Shelah's classification theory.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.