The following pages link to Robert I. Soare (Q207673):
Displaying 26 items.
- Post's problem and his hypersimple set (Q4404867) (← links)
- Encodability of Kleene's <i>O</i> (Q4404868) (← links)
- (Q4513979) (← links)
- Why Turing’s Thesis Is Not a Thesis (Q4637226) (← links)
- Games in recursion theory and continuity properties of capping degrees (Q4694275) (← links)
- Computational complexity of recursively enumerable sets (Q4750632) (← links)
- Automorphisms of the lattice of recursively enumerable sets (Q4767305) (← links)
- Dynamic properties of computably enumerable sets (Q4863241) (← links)
- Definability, Automorphisms, and Dynamic Properties of Computably Enumerable Sets (Q4897042) (← links)
- (Q4934276) (← links)
- (Q4934282) (← links)
- Bounding prime models (Q5311770) (← links)
- Computability and Incomputability (Q5425375) (← links)
- Recursion Theory and Dedekind Cuts (Q5571698) (← links)
- Sets with no subset of higher degree (Q5573379) (← links)
- Constructive order types on cuts (Q5573381) (← links)
- A note on degrees of subsets<sup>1</sup> (Q5581617) (← links)
- A problem in the theory of constructive order types (Q5590799) (← links)
- Minimal Covers and Arithmetical Sets (Q5604455) (← links)
- A minimal pair of Π<sub>1</sub><sup>0</sup> classes (Q5623677) (← links)
- The Friedberg-Muchnik Theorem Re-Examined (Q5631091) (← links)
- ∏ 0 1 Classes and Degrees of Theories (Q5677474) (← links)
- The Δ₃⁰-automorphism method and noninvariant classes of degrees (Q5687278) (← links)
- Computability and Recursion (Q5689263) (← links)
- Computability Theory and Differential Geometry (Q5717234) (← links)
- Extension of embeddings in the computably enumerable degrees (Q5945541) (← links)
