The following pages link to Theodore A. Slaman (Q189917):
Displaying 50 items.
- A polynomial-time algorithm for computing absolutely normal numbers (Q386000) (← links)
- \(\varPi^1_1\)-conservation of combinatorial principles weaker than Ramsey's theorem for pairs (Q436224) (← links)
- The inductive strength of Ramsey's theorem for pairs (Q507201) (← links)
- Differences between resource bounded degree structures (Q558725) (← links)
- Working below a \(low_ 2\) recursively enumerable degree (Q584251) (← links)
- The theory of the \(\alpha \) degrees is undecidable (Q607833) (← links)
- Automorphisms in the PTIME-Turing degrees of recursive sets (Q676317) (← links)
- Irrationality exponent, Hausdorff dimension and effectivization (Q681473) (← links)
- On the theory of the PTIME degrees of the recursive sets (Q751819) (← links)
- The density of infima in the recursively enumerable degrees (Q809074) (← links)
- Reflection and forcing in E-recursion theory (Q1062978) (← links)
- Definability in the Turing degrees (Q1075320) (← links)
- Completely mitotic r. e. degrees (Q1092895) (← links)
- Inadmissible forcing (Q1102950) (← links)
- (Q1123888) (redirect page) (← links)
- Generic copies of countable structures (Q1123889) (← links)
- The complexity types of computable sets (Q1190982) (← links)
- On co-simple isols and their intersection types (Q1192351) (← links)
- The p-T-degrees of the recursive sets: Lattice embeddings, extensions of embeddings and the two-quantifier theory (Q1193873) (← links)
- Extending partial orders to dense linear orders (Q1295404) (← links)
- Extremes in the degrees of inferability (Q1319507) (← links)
- \(\Pi_1^0\) classes and minimal degrees (Q1368582) (← links)
- Definability in the enumeration degrees (Q1387092) (← links)
- Quasi-minimal enumeration degrees and minimal Turing degrees (Q1568759) (← links)
- Defining the Turing jump (Q1574741) (← links)
- On the strength of Ramsey's theorem (Q1913632) (← links)
- Fragments of the theory of the enumeration degrees (Q2020402) (← links)
- Schmerl decompositions in first order arithmetic (Q2326427) (← links)
- Generics for computable Mathias forcing (Q2453068) (← links)
- \(\Pi^0_1\)-presentations of algebras (Q2505502) (← links)
- Some results on effective randomness (Q2509038) (← links)
- On simply normal numbers to different bases (Q2634869) (← links)
- On the strength of Ramsey's theorem for pairs (Q2732267) (← links)
- An almost deep degree (Q2747726) (← links)
- A splitting theorem for \(n\)-REA degrees (Q2750871) (← links)
- Randomness and recursive enumerability (Q2784448) (← links)
- The irrationality exponents of computable numbers (Q2790259) (← links)
- Relative to any non-hyperarithmetic set (Q2853977) (← links)
- The \(n\)-r.e. degrees: undecidability and \(\Sigma_1\) substructures (Q2909622) (← links)
- A note on initial segments of the enumeration degrees (Q2921013) (← links)
- On the normality of numbers to different bases (Q2922848) (← links)
- On zeros of Martin-Löf random Brownian motion (Q2941095) (← links)
- $$\Sigma _{1}^{1}$$ in Every Real in a $$\Sigma _{1}^{1}$$ Class of Reals Is $$\Sigma _{1}^{1}$$ (Q2970972) (← links)
- The Slaman-Wehner theorem in higher recursion theory (Q3003597) (← links)
- On the Kleene degrees of <i>Π</i><sub>1</sub><sup>1</sup> sets (Q3029002) (← links)
- Complementation in the Turing degrees (Q3032238) (← links)
- (Q3032239) (← links)
- The Π<sub>2</sub><sup>0</sup> enumeration degrees are not dense (Q3128478) (← links)
- Definability in the Recursively Enumerable Degrees (Q3128481) (← links)
- Every Set has a Least Jump Enumeration (Q3150949) (← links)
