Book contents
- Frontmatter
- Contents
- Preface
- Introduction
- Some results on ℝ-computable structures
- Infinite time Turing machines and an application to the hierarchy of equivalence relations on the reals
- Computable structure theory using admissible recursion theory on ω1 using admissibility
- Local computability and uncountable structures
- Borel structures: a brief survey
- E-recursive intuitions
- Reverse mathematics, countable and uncountable: a computational approach
- Effective model theory: approach via σ-definability
- References
E-recursive intuitions
Published online by Cambridge University Press: 05 December 2013
Book contents
- Frontmatter
- Contents
- Preface
- Introduction
- Some results on ℝ-computable structures
- Infinite time Turing machines and an application to the hierarchy of equivalence relations on the reals
- Computable structure theory using admissible recursion theory on ω1 using admissibility
- Local computability and uncountable structures
- Borel structures: a brief survey
- E-recursive intuitions
- Reverse mathematics, countable and uncountable: a computational approach
- Effective model theory: approach via σ-definability
- References
Summary
A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
- Type
- Chapter
- Information
- Effective Mathematics of the Uncountable , pp. 135 - 149Publisher: Cambridge University PressPrint publication year: 2013
References
[1] (1973), Contributions to Recursion Theory in Higher Types, Ph.D. Thesis, MIT, Cambridge, Massachusetts.4
[3] (1980), Descriptive Set Theory, North-Holland, Amsterdam.
[4] (1978), Set recursion. In Generalized Recursion Theory II, North-Holland, Amsterdam, 303–320.
[6] (1990), Higher Recursion Theory, Springer-Verlag, Berlin.
[7] (1985), Reflection and forcing in E-recursion theory, Ann. Pure and Appl. Log. 29, 79–106.Google Scholar
[8] (1985a), The E-recursively enumerable degrees are dense. In Proceedings of Symposia in Pure Math., Amer. Math. Soc. 42, 195–213.Google Scholar
- 1
- Cited by