Keywords
- Priority List
- Minimal Pair
- Recursion Theory
- Uniformization Theorem
- Skolem Function
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
K.J. Devlin, Aspects of constructibility, Lecture Notes in Mathematics Vol.354, Springer Verlag
S.D. Friedman, Recursion on Inadmissible Ordinals, Ph.D.Thesis, M.I.T., 1976
S.D. Friedman and G.E. Sacks, Inadmissible Recursion Theory, BAMS Vol. 83 No.1, 1977
S.D. Friedman, β-Recursion Theory, to appear
S.D. Friedman, Post's Problem without Admissibility, to appear
W. Maass, Inadmissibility, tame RE Sets and the admissible collapse, to appear in Ann. Math. Logic
W. Maass, High α-recursively enumerable degrees, to appear
G.E. Sacks, RE sets higher up, Proceedings of the Int. Congress for Logic, Phil. and Meth. of Science 1975, to appear
G.E. Sacks and S.G. Simpson, The α-finite injury method, Ann. Math. Logic 4 (1972) 323–367
R.A. Shore, Σn sets which are Δn incomparable (uniformly), J. Symb. Logic 39 (1974) 295–304
R.A. Shore, The recursively enumerable α-degrees are dense, Ann. Math. Logic 9 (1976) 123–155
R.A. Shore, Some more minimal pairs of α-recursively enumerable degrees, to appear
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1978 Springer-Verlag
About this paper
Cite this paper
Maass, W. (1978). Fine structure theory of the constructible universe in α- and β-recursion theory. In: Müller, G.H., Scott, D.S. (eds) Higher Set Theory. Lecture Notes in Mathematics, vol 669. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0103107
Download citation
DOI: https://doi.org/10.1007/BFb0103107
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08926-1
Online ISBN: 978-3-540-35749-0
eBook Packages: Springer Book Archive
