Π11 sets of sets, hyperdegrees and related problems

Hisao TANAKA

doi:10.2969/jmsj/02540609

Π¹₁ sets of sets, hyperdegrees and related problems

Hisao TANAKA

Author information

JOURNAL FREE ACCESS

1973 Volume 25 Issue 4 Pages 609-621

DOI https://doi.org/10.2969/jmsj/02540609

Details

Published: 1973 Received: November 09, 1972 Available on J-STAGE: September 29, 2006 Accepted: - Advance online publication: - Revised: -
Correction information
Date of correction: September 29, 2006 Reason for correction: - Correction: CITATION Details: Wrong : 1) S. Feferman, Some applications of the notion of forcing and generic sets, Fund. Math., 56 (1965), 325-345.
2) K. Gödel, The consistency of the axiom of choice and the generalized continuum hypothesis, Princeton Univ. Press, Princeton, 1940.
3) P. G. Hinman, Some applications of forcing to hierarchy problems in arithmetic, Zeits. f. math. Logik u. Grundlagen d. Math., 15 (1969), 341-352.
4) S. C. Kleene, Hierarchies of number-theoretic predicates, Bull. Amer. Math. Soc., 61 (1955), 193-213.
5) H. Rogers, Jr., Theory of recursive functions and effective computability, McGraw-Hill, 1967.
6) C. Spector, Recursive well-orderings, J. Symbolic Logic, 20 (1955), 151-163.
7) H. Tanaka, Some results in effective descriptive set theory, RIMS Kyoto Univ., Ser. A, 3 (1967), 11-52.
8) H. Tanaka, A basis result for Π¹₁ sets of positive measure, Comment. Math. Univ. St. Paul (Tokyo), 16 (1968), 115-127.
9) H. Tanaka, Notes on measure and category in recursion theory, Ann. Japan Assoc. Philos. Sci., 3, No. 5 (1970), 43-53.
10) S. K. Thomason, The forcing method and the upper semi-lattice of hyperdegrees, Trans. Amer. Math. Soc., 129 (1967), 38-57.

Right : [1] S. Feferman, Some applications of the notion of forcing and generic sets, Fund. Math., 56 (1965), 325-345.
[2] K. Gödel, The consistency of the axiom of choice and the generalized continuum hypothesis, Princeton Univ. Press, Princeton, 1940.
[3] P. G. Hinman, Some applications of forcing to hierarchy problems in arithmetic, Zeits. f. math. Logik u. Grundlagen d. Math., 15 (1969), 341-352.
[4] S. C. Kleene, Hierarchies of number-theoretic predicates, Bull. Amer. Math. Soc., 61 (1955), 193-213.
[5] H. Rogers, Jr., Theory of recursive functions and effective computability, McGraw-Hill, 1967.
[6] C. Spector, Recursive well-orderings, J. Symbolic Logic, 20 (1955), 151-163.
[7] H. Tanaka, Some results in effective descriptive set theory, RIMS Kyoto Univ., Ser. A, 3 (1967), 11-52.
[8] H. Tanaka, A basis result for Π¹₁ sets of positive measure, Comment. Math. Univ. St. Paul (Tokyo), 16 (1968), 115-127.
[9] H. Tanaka, Notes on measure and category in recursion theory, Ann. Japan Assoc. Philos. Sci., 3, No. 5 (1970), 43-53.
[10] S. K. Thomason, The forcing method and the upper semi-lattice of hyperdegrees, Trans. Amer. Math. Soc., 129 (1967), 38-57.

Date of correction: September 29, 2006 Reason for correction: - Correction: PDF FILE Details: -

Corresponding author

Correction information

Register with J-STAGE for free!