Uncountable admissibles. I. Forcing
HTML articles powered by AMS MathViewer
- by Sy D. Friedman PDF
- Trans. Amer. Math. Soc. 270 (1982), 61-73 Request permission
Abstract:
Assume $V = L$. Let $\kappa$ be a regular cardinal and for $X \subseteq \kappa$ let $\alpha (X)$ denote the least ordinal $\alpha$ such that ${L_\alpha }[X]$ is admissible. In this paper we characterize those ordinals of the form $\alpha (X)$ using forcing and fine structure of $L$ techniques. This generalizes a theorem of Sacks which deals with the case $\kappa = \omega$.References
-
R. David, Some applications of Jensen’s coding theorem (to appear).
- Keith J. Devlin, Aspects of constructibility, Lecture Notes in Mathematics, Vol. 354, Springer-Verlag, Berlin-New York, 1973. MR 0376351, DOI 10.1007/BFb0059290
- Sy D. Friedman, Steel forcing and Barwise compactness, Ann. Math. Logic 22 (1982), no. 1, 31–46. MR 661476, DOI 10.1016/0003-4843(82)90014-6
- Sy D. Friedman, Uncountable admissibles. I. Forcing, Trans. Amer. Math. Soc. 270 (1982), no. 1, 61–73. MR 642330, DOI 10.1090/S0002-9947-1982-0642330-8
- Harvey Friedman, One hundred and two problems in mathematical logic, J. Symbolic Logic 40 (1975), 113–129. MR 369018, DOI 10.2307/2271891
- R. O. Gandy and G. E. Sacks, A minimal hyperdegree, Fund. Math. 61 (1967), 215–223. MR 225653, DOI 10.4064/fm-61-2-215-223 Leo Harrington, Contributions to recursion theory in higher types, Ph.D. Thesis, MIT. R. Jensen, Forcing over admissible sets, Notes by K. Devlin, unpublished.
- R. Björn Jensen, The fine structure of the constructible hierarchy, Ann. Math. Logic 4 (1972), 229–308; erratum, ibid. 4 (1972), 443. With a section by Jack Silver. MR 309729, DOI 10.1016/0003-4843(72)90001-0 —, Coding the universe by a real, unpublished manuscript.
- R. B. Jensen and R. M. Solovay, Some applications of almost disjoint sets, Mathematical Logic and Foundations of Set Theory (Proc. Internat. Colloq., Jerusalem, 1968) North-Holland, Amsterdam, 1970, pp. 84–104. MR 0289291
- Gerald E. Sacks, The $1$-section of a type $n$ object, Generalized recursion theory (Proc. Sympos., Univ. Oslo, Oslo, 1972), Studies in Logic and the Foundations of Math., Vol. 79, North-Holland, Amsterdam, 1974, pp. 81–93. MR 0398811
- Gerald E. Sacks, Countable admissible ordinals and hyperdegrees, Advances in Math. 20 (1976), no. 2, 213–262. MR 429523, DOI 10.1016/0001-8708(76)90187-0
- John R. Steel, Forcing with tagged trees, Ann. Math. Logic 15 (1978), no. 1, 55–74. MR 511943, DOI 10.1016/0003-4843(78)90026-8
Additional Information
- © Copyright 1982 American Mathematical Society
- Journal: Trans. Amer. Math. Soc. 270 (1982), 61-73
- MSC: Primary 03D60; Secondary 03C70, 03E45
- DOI: https://doi.org/10.1090/S0002-9947-1982-0642330-8
- MathSciNet review: 642330