The following pages link to Ambos-Spies, Klaus (Q162061):
Displaying 46 items.
- An Inhomogeneity in the Structure of Karp Degrees (Q3754607) (← links)
- Cupping and noncapping in the r.e. weak truth table and turing degrees (Q3755448) (← links)
- Lattice embeddings into the recursively enumerable degrees (Q3770516) (← links)
- (Q3778006) (← links)
- Degree theoretical splitting properties of recursively enumerable sets (Q3826534) (← links)
- (Q3942948) (← links)
- (Q3975929) (← links)
- The theory of the recursively enumerable weak truth-table degrees is undecidable (Q4032867) (← links)
- Lattice embeddings into the recursively enumerable degrees. II (Q4205431) (← links)
- (Q4218120) (← links)
- (Q4268494) (← links)
- Lattice Embeddings into the R.E. Degrees Preserving 0 and 1 (Q4286357) (← links)
- Discontinuity of Cappings in the Recursively Enumerable Degrees and Strongly Nonbranching Degrees (Q4304089) (← links)
- (Q4325778) (← links)
- (Q4348122) (← links)
- (Q4452093) (← links)
- (Q4501552) (← links)
- (Q4513960) (← links)
- (Q4525724) (← links)
- (Q4536350) (← links)
- Resource-bounded balanced genericity, stochasticity and weak randomness (Q4593918) (← links)
- (Q4619825) (← links)
- On optimal polynomial time approximations: P-levelability vs. δ-levelability (Q4645194) (← links)
- Automorphism bases for the recursively enumerable degrees (Q4683153) (← links)
- (Q4723714) (← links)
- (Q4734760) (← links)
- (Q4764099) (← links)
- (Q4854879) (← links)
- (Q4863237) (← links)
- (Q4934293) (← links)
- (Q4944898) (← links)
- (Q4982343) (← links)
- ON SUPERSETS OF NON-LOW SETS (Q5015733) (← links)
- The theory of the polynomial many-one degrees of recursive sets is undecidable (Q5096783) (← links)
- Genericity and measure for exponential time (Q5096879) (← links)
- (Q5187269) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311143) (← links)
- Comparing DNR and WWKL (Q5311768) (← links)
- Real Benefit of Promises and Advice (Q5326354) (← links)
- Mathematical Foundations of Computer Science 2003 (Q5431301) (← links)
- Decidability of the two-quantifier theory of the recursively enumerable weak truth-table degrees and other distributive upper semi-lattices (Q5687321) (← links)
- (Q5753945) (← links)
- Weakly computable real numbers (Q5925970) (← links)
- Separating NP-completeness notions under strong hypotheses (Q5929911) (← links)
- Embeddings of \(N_5\) and the contiguous degrees (Q5956887) (← links)
- Lowness properties for strong reducibilities and the computational power of maximal sets (Q6128323) (← links)
