Π11 sets of sets, hyperdegrees and related problems

Hisao TANAKA

doi:10.2969/jmsj/02540609

Π¹₁ sets of sets, hyperdegrees and related problems

Hisao TANAKA

著者情報

ジャーナルフリー

1973 年 25 巻 4 号 p. 609-621

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

詳細

Published: 1973 Received: 1972/11/09 Available on J-STAGE: 2006/09/29 Accepted: - Advance online publication: - Revised: -
訂正情報
訂正日: 2006/09/29 訂正理由: - 訂正箇所: 引用文献情報訂正内容: 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.

訂正日: 2006/09/29 訂正理由: - 訂正箇所: PDFファイル訂正内容: -

責任著者(Corresponding author)

訂正情報

J-STAGEへの登録はこちら（無料）