Article contents
ON THE NON-ENUMERABILITY OF L
Published online by Cambridge University Press: 01 December 2016
Abstract
Assume V ≠ L. Then L is not E-Recursively Enumerable in any member of L via a forcing argument inspired by Friedberg [1]. This approach leads to an extension of Levy-Shoenfield absoluteness.
Keywords
- Type
- Articles
- Information
- Copyright
- Copyright © The Association for Symbolic Logic 2016
References
REFERENCES
Friedberg, R., A criterion for completeness of degrees of unsolvability, this JOURNAL, vol. 22 (1957), pp. 159–160.Google Scholar
Kleene, S. C.,
Recursive functionals and quantifiers of finite type I
. Transactions of the American Mathematical Society, vol. 91 (1959), pp. 1–52.Google Scholar
Lerman, M.,
Maximal α-r. e. sets
. Transactions of the American Mathematical Society, vol. 181 (1974), pp. 341–386.Google Scholar
Normann, D.,
Set recursion
, Generalized Recursion Theory II, North-Holland, Amsterdam, 1978.Google Scholar
Sacks, G.,
E-Recursive intuitions
, Effective Mathematics of the Uncountable, Cambridge University Press, Cambridge, 2013.Google Scholar
Shore, R.,
Splitting an α-r. e. set
. Transactions of the American Mathematical Society, vol. 204 (1975), pp. 65–77.Google Scholar
Simpson, S., Degree Theory on Admissible Ordinals, Proceedings of the 1972 Oslo Symposium, North-Holland, Amsterdam, 1974.Google Scholar
- 1
- Cited by