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