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, Maximal sets and fragments of Peano arithmetic, Nagoya Math. J., to appear
C. T. Chong, Hyperhypersimple sets and Δ2 systems, Annals of Pure and Applied Logic, to appear
C. T. Chong and M. Lerman, Hyperhypersimple α r.e. sets, Annals of Math. Logic 9 (1976), 1–48
R. M. Friedberg, Three theorems on recursive enumeration: I. Decomposition, II. Maximal set, III. Enumeration without duplication, J. Symbolic Logic 23 (1957), 309–316
S. D. Friedman, Negative solutions to Post's problem, II., Annals Math., 113 (1981), 25–43
M. Groszek and M. Mytilinaios, Σ2 induction and the construction of a high degrees, to appear
M. Groszek and T. A. Slaman, On turing reducibility, to appear
A. H. Lachlan, On the lattice of recursively enumerable sets, Trans. Amer. Math. Soc. 35 (1968), 123–146
A. H. Lachlan, A recursively enumerable set which will not split over all lesser ones, Annals Math. Logic 9 (1975), 307–365
M. Lerman, Maximal α-r.e. sets, Trans. Amer. Math. Soc, 188 (1974), 341–386
M. Lerman asnd S. G. Simpson, Maximal sets in α recursion theory, Israel J. Math. 4 (1973), 236–247
M. Mytilinaios, Finite injury and Σ1 induction, to appear
M. Mytilinaios and T. A. Slaman, Σ2 collection and the infinite injury priority method, J. Symbolic Logic, to appear
J. B. Paris and L. A. Kirby, Σn collection schemas in arithmetic, in: Logic Colloquium '77, North-Holland, 1978
E. L. Post, Recursively enumerable sets of integers and their decision problems, Bull. Amer. Math. Soc., 50 (1944), 284–316
R. A. Shore, The ∀∃ theory of r.e. sets, in: Generalized Recursion Theory II, North-Holland, 1978
R. A. Shore, On the jump of an α-recursively enumerable set, Trans. Amer. Math. Soc. 217 (1978), 351–363
T. A. Slaman and H. Woodin, Σ1 collection and the finite injury priority method, to appear
R. I. Soare, Automorphisms of the latttice of recursively enumerable sets, Part I: Maximal sets, Annals of Math. (2) 100 (1974), 80–120
R. I. Soare, Recursively Enumerable Sets and Degrees, Θ Series, Springer Verlag, 1987
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1989 Springer-Verlag
About this paper
Cite this paper
Chong, C.T. (1989). Recursively enumerable sets in models of Σ2 collection. In: Shinoda, J., Tugué, T., Slaman, T.A. (eds) Mathematical Logic and Applications. Lecture Notes in Mathematics, vol 1388. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0083664
Download citation
DOI: https://doi.org/10.1007/BFb0083664
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51527-2
Online ISBN: 978-3-540-48220-8
eBook Packages: Springer Book Archive
