A translation via outer measures yields new metatheorems that extract computable bounds from non-effective proofs of probabilistic existence statements while preserving validity over finitely additive spaces.
Tao.Structure and Randomness: Pages from Year One of a Mathematical Blog, chapter Soft Analy- sis, Hard Analysis, and the Finite Convergence Principle, pages 17–29
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.LO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A systematic way of analysing proofs in probability theory
A translation via outer measures yields new metatheorems that extract computable bounds from non-effective proofs of probabilistic existence statements while preserving validity over finitely additive spaces.