The following pages link to Yiannis N. Moschovakis (Q638493):
Displaying 21 items.
- Classical descriptive set theory as a refinement of effective descriptive set theory (Q638494) (← links)
- Computable concurrent processes (Q673972) (← links)
- A model of concurrency with fair merge and full recursion (Q808690) (← links)
- Descriptive set theory (Q1139038) (← links)
- Elementary induction on abstract structures (Q1217684) (← links)
- On primitive recursive algorithms and the greatest common divisor function (Q1399976) (← links)
- Intuitionism and effective descriptive set theory (Q1688967) (← links)
- (Q2524557) (redirect page) (← links)
- Many-one degrees of the predicates \(H_ a(x)\) (Q2524558) (← links)
- The Suslin-Kleene theorem for countable structures (Q2542989) (← links)
- The Suslin-Kleene theorem for \(V_\kappa\) with cofinality(\(\kappa)=\omega\). (Q2550019) (← links)
- Two theorems about projective sets (Q2559465) (← links)
- (Q2762147) (← links)
- Kleene's Amazing Second Recursion Theorem (Q3161629) (← links)
- (Q3204036) (← links)
- Hyperarithmetical Sets (Q3305318) (← links)
- (Q3342564) (← links)
- Notes on Set Theory (Q3376047) (← links)
- Is the Euclidean Algorithm Optimal Among its Peers? (Q4678946) (← links)
- SOME CONSEQUENCES OF THE AXIOM OF DEFINABLE DETERMINATENESS (Q5580117) (← links)
- Recursive metric spaces (Q5625126) (← links)
