Remote Access Transactions of the American Mathematical Society
Green Open Access

Transactions of the American Mathematical Society

ISSN 1088-6850(online) ISSN 0002-9947(print)

 
 

 

Measure-theoretic uniformity in recursion theory and set theory


Author: Gerald E. Sacks
Journal: Trans. Amer. Math. Soc. 142 (1969), 381-420
MSC: Primary 02.68
DOI: https://doi.org/10.1090/S0002-9947-1969-0253895-6
MathSciNet review: 0253895
Full-text PDF Free Access

References | Similar Articles | Additional Information

References [Enhancements On Off] (What's this?)

  • [1] J. W. Addison, The undefinability of the definable, Abstract 622-71, Notices Amer. Math. Soc. 12 (1965), 347-348.
  • [2] P. J. Cohen, The independence of the continuum hypothesis. I, II, Proc. Nat. Acad. Sci. U.S.A. 50 (1963), 1143-1148; 51 (1964), 105-110. MR 0159745 (28:2962)
  • [3] S. Feferman, Some applications of the notions of forcing and generic sets, Fund. Math. 56 (1965), 325-345. MR 0176925 (31:1193)
  • [4] S. Feferman and C. Spector, Incompleteness along paths in progressions of theories, J. Symbolic Logic 27 (1962), 383-390. MR 0172793 (30:3012)
  • [5] W. Feller, An introduction to probability theory and its applications, Wiley, New York, 1957. MR 0088081 (19:466a)
  • [6] R. O. Gandy, Proof of Mostowski's conjecture, Bull. Acad. Polon. Sci. Ser. Math. 8 (1960), 571-575. MR 0126383 (23:A3679)
  • [7] -, On a problem of Kleene, Bull. Amer. Math. Soc. 66 (1960), 501-502. MR 0122724 (23:A64)
  • [8] K. Gödel, Consistency proof of the generalized continuum hypothesis, Proc. Nat. Acad. Sci. U.S.A. 25 (1939), 220-224.
  • [9] -, The consistency of the axiom of choice and of the generalized continuum hypothesis with the axioms of set theory, 4th printing, Princeton Univ. Press, Princeton, N. J., 1958.
  • [10] P. R. Halmos, Measure theory, Van Nostrand, Princeton, N. J., 1950. MR 0033869 (11:504d)
  • [11] S. C. Kleene, On the forms of the predicates in the theory of constructive ordinals (second paper), Amer. J. Math. 77 (1955), 405-428. MR 0070595 (17:5a)
  • [12] -, Arithmetical predicates and function quantifiers, Trans. Amer. Math. Soc. 79 (1955), 312-340. MR 0070594 (17:4g)
  • [13] -, Hierarchies of number-theoretic predicates, Bull. Amer. Math. Soc. 61 (1955), 193-213. MR 0070593 (17:4f)
  • [14] -, Quantification of number-theoretic functions, Compositio Math. 14 (1959), 23-40. MR 0103822 (21:2586)
  • [15] G. Kreisel, Set theoretic problems suggested by the notion of potential totality, Proc. Sympos. Infinitistic Methods, Warsaw, 1961, pp. 103-140. MR 0146073 (26:3599)
  • [16] -, The axiom of choice and the class of hyperarithmetic functions, Indag. Math. 24 (1962), 307-319. MR 0140418 (25:3838)
  • [17] G. Kreisel and G. E. Sacks, Metarecursive sets, J. Symbolic Logic 30 (1965), 318-338. MR 0213233 (35:4097)
  • [18] S. Kripke, Transfinite recursions on admissible ordinals. I and II (abstracts), J. Symbolic Logic 29 (1964), 161-162.
  • [19] R. A. Platek, Foundations of recursion theory, Ph.D. Thesis, Stanford Univ., Stanford, Calif., 1965.
  • [20] H. Rogers, Theory of recursive functions and effective computability, McGraw-Hill, New York, 1967. MR 0224462 (37:61)
  • [21] J. Rosenthal, Addition of relations in model theory; Truth in all of certain well-founded countable models arising in set theory, Ph.D. Thesis, Massachusetts Institute of Technology, Cambridge, Mass., 1968. MR 0414362 (54:2465)
  • [22] G. E. Sacks, Degrees of unsolvability, Princeton Univ. Press, Princeton, N. J., 1963.
  • [23] -, Measure-theoretic uniformity, Bull. Amer. Math. Soc. 73 (1967), 169-174. MR 0213234 (35:4098)
  • [24] -, Higher recursion theory, Lecture Notes, Massachusetts Institute of Technology, Cambridge, Mass., 1966.
  • [25] D. Scott, Lectures on Boolean-valued models for set theory, Amer. Math. Soc. Summer Institute on Axiomatic Set Theory, UCLA, 1967. Lecture Notes.($ ^{14}$)
  • [26] D. Scott and R. Solovay, ``Boolean-valued models for set theory'' in Axiomatic set theory, Proc. Sympos. Pure Math., vol. 13, Amer. Math. Soc., Providence, R. I. (to appear). MR 0290961 (45:55)
  • [27] J. R. Shoenfield, The problem of predicativity, Essays on the Foundations of Mathematics, Magnes Press, Hebrew Univ., Jerusalem, 1961, pp. 132-139. MR 0164886 (29:2177)
  • [28] W. Sierpiński, Les ensembles projectifs et analytiques, Mémor. Sci. Math., no. 112, Gauthier-Villars, Paris, 1950. MR 0052484 (14:627c)
  • [29] R. Solovay, The measure problem, Abstract 65T-62, Notices Amer. Math. Soc. 12 (1965), 217.
  • [30] -, The measure problem, (to appear).
  • [31] C. Spector, Recursive well-orderings, J. Symbolic Logic 20 (1955), 151-163. MR 0074347 (17:570b)
  • [32] -, Measure-theoretic construction of incomparable hyperdegrees, J. Symbolic Logic 23 (1958), 280-288. MR 0112830 (22:3681)
  • [33] -, Hyperarithmetical quantifiers, Fund. Math. 48 (1959), 312-320. MR 0120147 (22:10904)
  • [34] H. Tanaka, Some results in the effective descriptive set theory, Publ. RIMS, Kyoto Univ. Ser A 3 (1967), 11-52. MR 0228345 (37:3926)
  • [35] -, A basis result for $ \prod _1^1$-sets of positive measure, Hosei University, 1967.
  • [36] L. Tharp, Set theory, Lecture Notes, Massachusetts Institute of Technology, Cambridge, Mass., 1965.

Similar Articles

Retrieve articles in Transactions of the American Mathematical Society with MSC: 02.68

Retrieve articles in all journals with MSC: 02.68


Additional Information

DOI: https://doi.org/10.1090/S0002-9947-1969-0253895-6
Article copyright: © Copyright 1969 American Mathematical Society

American Mathematical Society