scientific article; zbMATH DE number 5064952
From MaRDI portal
zbMath1107.03047MaRDI QIDQ5494235
Publication date: 17 October 2006
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
\(K\)-trivialityr.e. degreesjump-traceabilitylow r.e. setcombinatorial lowness propertiessuper-lowness
Related Items
Randomness and reducibility, On Kurtz randomness, Random non-cupping revisited, Limit computability and ultrafilters, A measure-theoretic proof of Turing incomparability, Upper bounds on ideals in the computably enumerable Turing degrees, Demuth randomness and computational complexity, Computably enumerable sets below random sets, Characterizing the strongly jump-traceable sets via randomness, On strongly jump traceable reals, Strong jump-traceability. I: The computably enumerable case, \(\Pi_1^0 \) classes, LR degrees and Turing degrees, Lowness properties and approximations of the jump, Lowness for Demuth Randomness, Computable numberings of families of low sets and Turing jumps in the Ershov hierarchy, Building models of strongly minimal theories, Hierarchy of Computably Enumerable Degrees II, 𝐾-trivial degrees and the jump-traceability hierarchy, Tracing and domination in the Turing degrees, Lowness properties and randomness, On trees without hyperimmune branches, Limitwise monotonic spectra and their generalizations
