Inadmissible recursion theory
HTML articles powered by AMS MathViewer
- by S. D. Friedman and G. E. Sacks PDF
- Bull. Amer. Math. Soc. 83 (1977), 255-256
References
- Keith J. Devlin, Aspects of constructibility, Lecture Notes in Mathematics, Vol. 354, Springer-Verlag, Berlin-New York, 1973. MR 0376351, DOI 10.1007/BFb0059290 2. S. D. Friedman, Recursion on inadmissible ordinals, Ph. D. Thesis, Massachusetts Institute of Technology, 1976.
- Manuel Lerman and Gerald E. Sacks, Some minimal pairs of $\alpha$-recursively enumerable degrees, Ann. Math. Logic 4 (1972), 415–442. MR 439605, DOI 10.1016/0003-4843(72)90007-1
- Wolfgang Maass, Inadmissibility, tame r.e. sets and the admissible collapse, Ann. Math. Logic 13 (1978), no. 2, 149–170. MR 486628, DOI 10.1016/0003-4843(78)90002-5
- G. E. Sacks and S. G. Simpson, The $\alpha$-finite injury method, Ann. Math. Logic 4 (1972), 343–367. MR 369041, DOI 10.1016/0003-4843(72)90004-6
- Richard A. Shore, The recursively enumerable $\alpha$-degrees are dense, Ann. Math. Logic 9 (1976), no. 1-2, 123–155. MR 381963, DOI 10.1016/0003-4843(76)90007-3
Additional Information
- Journal: Bull. Amer. Math. Soc. 83 (1977), 255-256
- MSC (1970): Primary 02F27
- DOI: https://doi.org/10.1090/S0002-9904-1977-14289-4
- MathSciNet review: 0505378