Keywords
- Negative Solution
- Peano Arithmetic
- Recursion Theory
- Turing Degree
- Limit Ordinal
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 and K. J. Mourad, The Friedberg-Muchnik Theorem without Σ1 induction, in preparation
C. T. Chong and K. J. Mourad, Post's problem and singularity, in preparation
S. D. Friedman, Post's problem without admissibility, Advances in Math. 35 (1980), 30–49
S. D. Friedman, β recursion theory, Trans. Amer. Math. Soc. 255 (1979), 173–200
S. D. Friedman, Negative solutions to Post's problem I, in: Generalized Recursion Theory II, North-Holland, 1978, 127–134
S. D. Friedman, Negative solutions to Post's problem II, Annals Math. 113 (1981), 25–43
S. D. Friedman, An introduction to β recursion theory, in: Generalized Recursion Theory II, North-Holland, 1978, 111–126
M. Mytilinaios, Finite injury and Σ1 induction, J. Symbolic Logic 54 (1989), 38–49
G. E. Sacks and S. G. Simpson, The α-finite injury method, Annals Math. Logic 4 (1972), 343–368
W. Maass, Recursively invariant β-recursion theory, Annals Math. Logic 21 (1981), 27–73
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 Springer-Verlag
About this paper
Cite this paper
Chong, C.T., Mourad, K.J. (1990). Positive solutions to Post's problem. In: Ambos-Spies, K., Müller, G.H., Sacks, G.E. (eds) Recursion Theory Week. Lecture Notes in Mathematics, vol 1432. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0086112
Download citation
DOI: https://doi.org/10.1007/BFb0086112
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52772-5
Online ISBN: 978-3-540-47142-4
eBook Packages: Springer Book Archive
