Here we present the principal ideas and results of  with some indications of proof. The general notion of uniformity is difficult to harvest; nonetheless, various offshoots of it have borne fruit in all fields of mathematical logic. In this paper we introduce the notion of measure-theoretic uniformity, and we describe its use in recursion theory, hyperarithmetic analysis, and set theory. In recursion theory we show that the set of all sets T such that the ordinals recursive in T are the recursive ordinals has measure 1. In set theory we obtain all of Cohen’s independence results [1,2]. Solovay [8,9] has extended Cohen’s method by forcing statements with closed, measurable sets of conditions rather than finite sets of conditions; in this manner he exploits the concepts of forcing and genericity to prove: if ZF is consistent, then ZF + “there exists a translation-invariant, countably additive extension of Lebesgue measure defined on all sets of reals” + “the dependent axiom of choice” is consistent. Solovay’s result is also a consequence of the notion of measure-theoretic uniformity.
Unable to display preview. Download preview PDF.
- 5.Sacks, G. E.: Measure-theoretic uniformity in recursion theory and set theory. Trans. Amer. Math. Soc, to appear.Google Scholar
- 6.— On the fundamental equivalence type of a countable model. In preparation.Google Scholar
- 7.Scott, D., and R. Solovay: Boolean-valued models and forcing. To appear.Google Scholar
- 8.Solovay, R.: The measure problem, Abstract 65T-62. Not. Amer. Math. Soc. 12, 217 (1965).Google Scholar
- 9.— The measure problem. To appear.Google Scholar
- 11.Tanaka, H.: Some results in the effective descriptive set theory. Publ. RIMS, Kyoto Univ. Ser A, 3 II-52 (1967).Google Scholar
- 12.Tanaka, H. — A basis result for II 11 — sets of positive measure. Mimeographed notes, Hosei University 1967.Google Scholar