The following pages link to Robert I. Soare (Q207673):
Displaying 50 items.
- (Q802549) (redirect page) (← links)
- The elementary theory of the recursively enumerable degrees is not \(\aleph _ 0\)-categorical (Q802550) (← links)
- Degrees of orderings not isomorphic to recursive linear orderings (Q810503) (← links)
- \(\Pi_1^0\) classes, Peano arithmetic, randomness, and computable domination (Q976541) (← links)
- Computability of homogeneous models (Q998144) (← links)
- Turing oracle machines, online computing, and three displacements in computability theory (Q1032637) (← links)
- Members of countable \(\Pi ^ 0_ 1\) classes (Q1084100) (← links)
- Not every finite lattice is embeddable in the recursively enumerable degrees (Q1142206) (← links)
- d-simple sets, small sets, and degree classes (Q1155608) (← links)
- The d.r.e. degrees are not dense (Q1182487) (← links)
- \(r\)-maximal major subsets (Q1248505) (← links)
- Some lowness properties and computational complexity sequences (Q1255315) (← links)
- Definable properties of the computably enumerable sets (Q1295410) (← links)
- The continuity of cupping to \(\text \textbf{0}'\) (Q1314642) (← links)
- Minimal pairs and complete problems (Q1334663) (← links)
- The recursively enumerable degrees have infinitely many one-types (Q1823931) (← links)
- Corrigendum to: ``The d.r.e. degrees are not dense'' (Q2407276) (← links)
- Cohesive sets and recursively enumerable Dedekind cuts (Q2531924) (← links)
- Degrees of members of \(\Pi_ 1^ 0\) classes (Q2543461) (← links)
- Automorphisms of the lattice of recursively enumerable sets. I: Maximal sets (Q2557694) (← links)
- (Q2735600) (← links)
- Turing Computability (Q2864221) (← links)
- Formalism and intuition in computability (Q2941588) (← links)
- Automorphisms of the lattice of recursively enumerable sets. Part II: Low sets (Q3041174) (← links)
- An Algebraic Decomposition of the Recursively Enumerable Degrees and the Coincidence of Several Degree Classes with the Promptly Simple Degrees (Q3325709) (← links)
- Computability Results Used in Differential Geometry (Q3416121) (← links)
- Bounding homogenous models (Q3426576) (← links)
- Recursively enumerable sets modulo iterated jumps and extensions of Arslanov's completeness criterion (Q3489987) (← links)
- (Q3657980) (← links)
- (Q3690802) (← links)
- Two theorems on degrees of models of true arithmetic (Q3697017) (← links)
- (Q3819052) (← links)
- (Q3872442) (← links)
- A Decidable Fragment of the Elementary Theory of the Lattice of Recursively Enumerable Sets (Q3880826) (← links)
- (Q3897039) (← links)
- (Q3962983) (← links)
- (Q3975929) (← links)
- Post's program and incomplete recursively enumerable sets. (Q4024700) (← links)
- (Q4040892) (← links)
- Isomorphisms on countable vector spaces with recursive operations (Q4055975) (← links)
- Boolean algebras, splitting theorems, and $Δ^0_2$ sets (Q4090318) (← links)
- The infinite injury priority method (Q4094861) (← links)
- Recursively enumerable sets and degrees (Q4184825) (← links)
- Computational complexity, speedable and levelable sets (Q4185801) (← links)
- Models of arithmetic and upper bounds for arithmetic sets (Q4314684) (← links)
- Boolean algebras, Stone spaces, and the iterated Turing jump (Q4323032) (← links)
- Algebraic aspects of the computably enumerable degrees. (Q4326308) (← links)
- Codable sets and orbits of computably enumerable sets (Q4391418) (← links)
- Models of arithmetic and subuniform bounds for the arithmetic sets (Q4391422) (← links)
- (Q4395619) (← links)
