Keywords
- Order Theory
- Order Type
- Recursion Theory
- Splitting Operation
- Major Subset
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
C. T. Chong [1979], Major subsets of α-recursively enumerable sets, Israel J. Math. 34, 106–114
C. T. Chong [1983], Global and local admissibility: II. Major subsets and automorphisms, Annals Pure and Applied Logic 24, 99–111
C. T. Chong [to appear], Techniques of Admissible Recursion Theory
C. T. Chong and S. D. Friedman [1983], Degree theory on ℵω, Annals Pure and Applied Logic 24, 87–97
C. T. Chong and M. Lerman [1976], Hyperhypersimple α-r.e. sets, Annals Math. Logic 9, 1–48
S. D. Friedman [1981], Natural α-r.e. degrees, in: Logic Year 1979–1980, Lecture Notes in Math. Vol.859
S. D. Friedman [1981a], Nagative solutions to Post's problem II, Annals Math., 113, 25–43
S. D. Friedman [1983], Some recent developments in higher recursion theory, J. Symbolic Logic 48, 629–642
A. H. Lachlan [1975], A recursively enumerable degree which will not split over all lesser ones, Annals Math. Logic 9, 307–365
R. B. Jensen [1972], The fine structure of the constructible universe, Annals Math. Logic 4, 229–308
A. Leggett and R. A. Shore [1976], Types of simple α-recursively enumerable sets, J. Symbolic Logic 41, 681–694
M. Lerman [1976], Types of simple α-recursively enumerable sets, J. Symbolic Logic 41, 419–426
W. A. Maass [1978], High α-recursively enumerable degrees, in: Generalized Recursion Theory II, North Holland, 239–270
R. W. Robinson [1971], Interpolation and embedding in the recursively enumerable degrees, Annals Math. 93, 285–314
R. A. Shore [1976], On the jump of an α-recursively enumerable set, Trans. Amer. Math. Soc. 217, 351–363
R. A. Shore [1976a], The recursively enumerable α-degrees are dense, Annals Math. Logic 9, 123–155
R. A. Shore [1978], On the AE-sentences of α-recursion theory, in: Generalized Recursion Theory II, North Holland, 331–354
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1985 Springer-Verlag
About this paper
Cite this paper
Chong, C.T. (1985). Recursion theory on strongly Σ2 inadmissible ordinals. In: Ebbinghaus, HD., Müller, G.H., Sacks, G.E. (eds) Recursion Theory Week. Lecture Notes in Mathematics, vol 1141. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0076214
Download citation
DOI: https://doi.org/10.1007/BFb0076214
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15673-4
Online ISBN: 978-3-540-39596-6
eBook Packages: Springer Book Archive
