Publication:3197814
From MaRDI portal
zbMath0713.03020MaRDI QIDQ3197814
Michael Stob, Carl G. jun. Jockusch, Rodney G. Downey
Publication date: 1990
03D25: Recursively (computably) enumerable sets and degrees
Related Items
STRONG JUMP-TRACEABILITY, A HIERARCHY OF COMPUTABLY ENUMERABLE DEGREES, Trivial Reals, Nonlowness is independent from fickleness, Working with strong reducibilities above totally $\omega $-c.e. and array computable degrees, Array nonrecursiveness and relative recursive enumerability, Domination, forcing, array nonrecursiveness and relative recursive enumerability, Embeddings of \(N_5\) and the contiguous degrees, CUPPING AND JUMP CLASSES IN THE COMPUTABLY ENUMERABLE DEGREES, Maximality and collapse in the hierarchy of α-c.a. degrees, The degrees of bi-hyperhyperimmune sets, Lattice nonembeddings and initial segments of the recursively enumerable degrees, Effective domination and the bounded jump, Effectively closed sets and enumerations, Turing degrees of reals of positive effective packing dimension, Countable thin \(\Pi^0_1\) classes, Splitting theorems in recursion theory, Abstract complexity theory and the \(\Delta_{2}^{0}\) degrees, Lattice embeddings below a nonlow\(_ 2\) recursively enumerable degree, Maximal pairs of computably enumerable sets in the computably Lipschitz degrees, Multiple genericity: a new transfinite hierarchy of genericity notions, On realization of index sets in \(\Pi_1^0\)-classes, Integer valued betting strategies and Turing degrees, Small \(\Pi^{0}_{1}\) classes, Splitting into degrees with low computational strength, Automorphisms of the lattice of $\Pi _1^0$ classes; perfect thin classes and anc degrees, Bounded Randomness, Invariance in ℰ* and ℰ_{Π}, Hierarchy of Computably Enumerable Degrees II, Lowness for Demuth Randomness
