All Questions
1 question
5
votes
1
answer
416
views
Higher computability : Constructive ordinal and $\Delta^1_1$ predicates
Everything I know on this subject comes from Sacks book : "Higher recursion theory"
Let $\mathcal{O^Y}$ be the set of codes for ordinals constructive in $Y$.
We should have the result that $A \...
- 764