Hostname: page-component-77c89778f8-vpsfw Total loading time: 0 Render date: 2024-07-17T01:30:57.606Z Has data issue: false hasContentIssue false
  • English
  • Français

On a Π01 Set of Positive Measure

Published online by Cambridge University Press:  22 January 2016

Hisao Tanaka
Hisao Tanaka*
Affiliation:
Hosei University
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Some basis results for arithmetic, hyperarithmetic (HA) or sets which have positive measure (or which are not meager, i.e., of the second Baire category) have been obtained by several authors. For example, every non-meager set must have a recursive element (Shoenfield-Hinman, Hinman [2]) but there exists a non-meager set (as well as of measure 1) that contains no recursive element (Shoenfield [7]), and every set (i.e., arithmetic set) of positive measure contains an arithmetic element (Sacks [5], and Tanaka [12]).

Type
Research Article
Information
Nagoya Mathematical Journal , Volume 38 , March 1970 , pp. 139 - 144
Copyright
Copyright © Editorial Board of Nagoya Mathematical Journal 1970

References

[1] Addison, J.W., Some consequences of the axiom of constructibility, Fund. Math., 46 (1959), 337–357.CrossRefGoogle Scholar
[2] Hinman, P.G., Some applications of forcing to hierarchy problems in arithmetic, to appear.Google Scholar
[3] Kreisel, G., The axiom of choice and the class of hyperarithmetic functions, Indag. Math., 24 (1962), 308–319.Google Scholar
[4] Mathias, A.R.D., A survey of recent results in set theory, Mimeographed note, Stanford University, (1968).Google Scholar
[5] Sacks, G.E., Measure-theoretic uniformity in recursion theory and set theory, to appear. Summary of results in Bull. Amer. Math. Soc., 73 (1967), 169–174.Google Scholar
[6] Sampei, Y., A proof of Mansfield’s Theorem by forcing method, to appear.Google Scholar
[7] Shoenfield, J.R., The class of recursive functions, Proc. Amer. Math. Soc., 9 (1958), 690–692.Google Scholar
[8] Shoenfield, J.R., Mathematical Logic, Addison-Wesley Company (1967).Google Scholar
[9] Spector, C., Recursive well-orderings, J. Symbolic Logic, 20 (1955), 151–163.Google Scholar
[10] Spector, C., Hyperarithmetical quantifiers, Fund. Math., 48 (1960), 313–320.Google Scholar
[11] Solovay, R., On the cardinality of sets of reals, to appear.Google Scholar
[12] Tanaka, H., Some results in the effective descriptive set theory, Publ. RIMS, Kyoto Univ., Ser. A, 3 (1967), 11–52.Google Scholar