Note that for each n and α < α′ < 
, the number of splitting nodes along (xi ↾ n, fi ↾ n) in Ti[α] is greater than or equal to that in Ti[α′].
One may use T2[α] to define a Σ1(
-approximation 
of 
“from the left”: (O) [α] ⌢…⌢ (n)[α] is the leftmost string ...
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.
