Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Eberlein-Smulian compactness and Kolmogorov extension theorems; a model theoretic approach (1509.03193v3)

Published 10 Sep 2015 in math.LO

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.

Summary

We haven't generated a summary for this paper yet.