Uncountable admissibles. I. Forcing

Author:
Sy D. Friedman

Journal:
Trans. Amer. Math. Soc. **270** (1982), 61-73

MSC:
Primary 03D60; Secondary 03C70, 03E45

MathSciNet review:
642330

Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: Assume . Let be a regular cardinal and for let denote the least ordinal such that is admissible. In this paper we characterize those ordinals of the form using forcing and fine structure of techniques. This generalizes a theorem of Sacks which deals with the case .

**[1981]**R. David,*Some applications of Jensen's coding theorem*(to appear).**[1973]**Keith J. Devlin,*Aspects of constructibility*, Lecture Notes in Mathematics, Vol. 354, Springer-Verlag, Berlin-New York, 1973. MR**0376351****[1981]**Sy D. Friedman,*Steel forcing and Barwise compactness*, Ann. Math. Logic**22**(1982), no. 1, 31–46. MR**661476**, 10.1016/0003-4843(82)90014-6**[1981]**Sy D. Friedman,*Uncountable admissibles. II. Compactness*, Israel J. Math.**40**(1981), no. 2, 129–149. MR**634901**, 10.1007/BF02761905**[1975]**Harvey Friedman,*One hundred and two problems in mathematical logic*, J. Symbolic Logic**40**(1975), 113–129. MR**0369018****[1967]**R. O. Gandy and G. E. Sacks,*A minimal hyperdegree*, Fund. Math.**61**(1967), 215–223. MR**0225653****[1973]**Leo Harrington,*Contributions to recursion theory in higher types*, Ph.D. Thesis, MIT.**[1972]**R. Jensen,*Forcing over admissible sets*, Notes by K. Devlin, unpublished.**[1972A]**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**0309729****[1975]**-,*Coding the universe by a real*, unpublished manuscript.**[1970]**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****[1974]**Gerald E. Sacks,*The 1-section of a type 𝑛 object*, Generalized recursion theory (Proc. Sympos., Univ. Oslo, Oslo, 1972), North-Holland, Amsterdam, 1974, pp. 81–93. Studies in Logic and the Foundations of Math., Vol. 79. MR**0398811****[1976]**Gerald E. Sacks,*Countable admissible ordinals and hyperdegrees*, Advances in Math.**20**(1976), no. 2, 213–262. MR**0429523****[1978]**John R. Steel,*Forcing with tagged trees*, Ann. Math. Logic**15**(1978), no. 1, 55–74. MR**511943**, 10.1016/0003-4843(78)90026-8

Retrieve articles in *Transactions of the American Mathematical Society*
with MSC:
03D60,
03C70,
03E45

Retrieve articles in all journals with MSC: 03D60, 03C70, 03E45

Additional Information

DOI:
http://dx.doi.org/10.1090/S0002-9947-1982-0642330-8

Article copyright:
© Copyright 1982
American Mathematical Society