Endnotes
The construction of -sets
1 | Attempts were made by several authors to inductively define these sets (see, for example, [100]). In [17] a solution in this direction was given via a recursion-theoretic approach. |
2 | See [13] for a higher level analysis of Martin’s conjecture. |
B An interview with Gerald E. Sacks
3 | Department of Mathematics, National University of Singapore, Singapore 119076 |
4 | The Downward Löwenheim–Skolem Theorem states that every model of a countable theory has an elementary countable submodel. |
5 | Now known as the Sacks Splitting Theorem. |
6 | The Jump Theorem states that every degree that is r.e. in and above 0 |
Get Recursion Theory now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.