Measure-theoretic uniformity in recursion theory and set theory
HTML articles powered by AMS MathViewer
- by Gerald E. Sacks
- Trans. Amer. Math. Soc. 142 (1969), 381-420
- DOI: https://doi.org/10.1090/S0002-9947-1969-0253895-6
- PDF | Request permission
References
- J. W. Addison, The undefinability of the definable, Abstract 622-71, Notices Amer. Math. Soc. 12 (1965), 347-348.
- Paul J. Cohen, The independence of the continuum hypothesis. II, Proc. Nat. Acad. Sci. U.S.A. 51 (1964), 105–110. MR 159745, DOI 10.1073/pnas.51.1.105
- S. Feferman, Some applications of the notions of forcing and generic sets, Fund. Math. 56 (1964/65), 325–345. MR 176925, DOI 10.4064/fm-56-3-325-345
- S. Feferman and C. Spector, Incompleteness along paths in progressions of theories, J. Symbolic Logic 27 (1962), 383–390. MR 172793, DOI 10.2307/2964544
- William Feller, An introduction to probability theory and its applications. Vol. I, John Wiley & Sons, Inc., New York; Chapman & Hall, Ltd., London, 1957. 2nd ed. MR 0088081
- R. O. Gandy, Proof of Mostowski’s conjecture, Bull. Acad. Polon. Sci. Sér. Sci. Math. Astronom. Phys. 8 (1960), 571–575 (English, with Russian summary). MR 126383
- R. O. Gandy, On a problem of Kleene’s, Bull. Amer. Math. Soc. 66 (1960), 501–502. MR 122724, DOI 10.1090/S0002-9904-1960-10518-6 K. Gödel, Consistency proof of the generalized continuum hypothesis, Proc. Nat. Acad. Sci. U.S.A. 25 (1939), 220-224. —, 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.
- Paul R. Halmos, Measure Theory, D. Van Nostrand Co., Inc., New York, N. Y., 1950. MR 0033869, DOI 10.1007/978-1-4684-9440-2
- S. C. Kleene, On the forms of the predicates in the theory of constructive ordinals. II, Amer. J. Math. 77 (1955), 405–428. MR 70595, DOI 10.2307/2372632
- S. C. Kleene, Arithmetical predicates and function quantifiers, Trans. Amer. Math. Soc. 79 (1955), 312–340. MR 70594, DOI 10.1090/S0002-9947-1955-0070594-4
- S. C. Kleene, Hierarchies of number-theoretic predicates, Bull. Amer. Math. Soc. 61 (1955), 193–213. MR 70593, DOI 10.1090/S0002-9904-1955-09896-3
- S. C. Kleene, Quantification of number-theoretic functions, Compositio Math. 14 (1959), 23–40. MR 103822
- G. Kreisel, Set theoretic problems suggested by the notion of potential totality. , Infinitistic Methods (Proc. Sympos. Foundations of Math., Warsaw, 1959) Pergamon, Oxford; Państwowe Wydawnictwo Naukowe, Warsaw, 1961, pp. 103–140. MR 0146073
- G. Kreisel, The axiom of choice and the class of hyperarithmetic functions, Nederl. Akad. Wetensch. Proc. Ser. A 65 = Indag. Math. 24 (1962), 307–319. MR 0140418, DOI 10.1016/S1385-7258(62)50029-2
- G. Kreisel and Gerald E. Sacks, Metarecursive sets, J. Symbolic Logic 30 (1965), 318–338. MR 213233, DOI 10.2307/2269621 S. Kripke, Transfinite recursions on admissible ordinals. I and II (abstracts), J. Symbolic Logic 29 (1964), 161-162. R. A. Platek, Foundations of recursion theory, Ph.D. Thesis, Stanford Univ., Stanford, Calif., 1965.
- Hartley Rogers Jr., Theory of recursive functions and effective computability, McGraw-Hill Book Co., New York-Toronto-London, 1967. MR 0224462
- John W. Rosenthal, Truth in all of certain well-founded countable models arising in set theory, Z. Math. Logik Grundlagen Math. 21 (1975), 97–106. MR 414362, DOI 10.1002/malq.19750210113 G. E. Sȧcks, Degrees of unsolvability, Princeton Univ. Press, Princeton, N. J., 1963.
- Gerald E. Sacks, Measure-theoretic uniformity, Bull. Amer. Math. Soc. 73 (1967), 169–174. MR 213234, DOI 10.1090/S0002-9904-1967-11701-4 —, Higher recursion theory, Lecture Notes, Massachusetts Institute of Technology, Cambridge, Mass., 1966. D. Scott, Lectures on Boolean-valued models for set theory, Amer. Math. Soc. Summer Institute on Axiomatic Set Theory, UCLA, 1967. Lecture Notes.($^{14}$)
- Robert M. Solovay, Real-valued measurable cardinals, Axiomatic Set Theory (Proc. Sympos. Pure Math., Vol. XIII, Part I, Univ. California, Los Angeles, Calif., 1967) Amer. Math. Soc., Providence, R.I., 1971, pp. 397–428. MR 0290961
- J. R. Shoenfield, The problem of predicativity, Essays on the foundations of mathematics, Magnes Press, Hebrew Univ., Jerusalem, 1961, pp. 132–139. MR 0164886
- W. Sierpiński, Les ensembles projectifs et analytiques, Mémor. Sci. Math., no. 112, Gauthier-Villars, Paris, 1950 (French). MR 0052484 R. Solovay, The measure problem, Abstract 65T-62, Notices Amer. Math. Soc. 12 (1965), 217. —, The measure problem, (to appear).
- Clifford Spector, Recursive well-orderings, J. Symbolic Logic 20 (1955), 151–163. MR 74347, DOI 10.2307/2266902
- Clifford Spector, Measure-theoretic construction of incomparable hyperdegrees, J. Symbolic Logic 23 (1958), 280–288. MR 112830, DOI 10.2307/2964288
- C. Spector, Hyperarithmetical quantifiers, Fund. Math. 48 (1959/60), 313–320. MR 120147, DOI 10.4064/fm-48-3-313-320
- Hisao Tanaka, Some results in the effective descriptive set theory, Publ. Res. Inst. Math. Sci. Ser. A 3 (1967/1968), 11–52. MR 0228345, DOI 10.2977/prims/1195195654 —, A basis result for $\prod _1^1$-sets of positive measure, Hosei University, 1967. L. Tharp, Set theory, Lecture Notes, Massachusetts Institute of Technology, Cambridge, Mass., 1965.
Bibliographic Information
- © Copyright 1969 American Mathematical Society
- 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