scientific article; zbMATH DE number 4135927

MaRDI QIDQ3469096zbMATH OpenFDO

Authors Carl G. jun. Jockusch

Publication date 1989

zbMATH Keywords

diagonally non-recursiveeffectively immune setfixed-points free

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) Other degrees and reducibilities in computability and recursion theory (03D30)

Cited in

(20)

• Computable analogs of cardinal characteristics: prediction and rearrangement
• On low for speed oracles
• Highness properties close to PA completeness
• Thin set versions of Hindman's theorem
• Inside the Muchnik degrees. II: The degree structures induced by the arithmetical hierarchy of countably continuous functions
• The axiomatic power of Kolmogorov complexity
• On uniform relationships between combinatorial problems
• Degrees of unsolvability: a tutorial
• scientific article; zbMATH DE number 4168664 (Why is no real title available?)
• Propagation of partial randomness
• scientific article; zbMATH DE number 58108 (Why is no real title available?)
• Characterizing the strongly jump-traceable sets via randomness
• scientific article; zbMATH DE number 4118353 (Why is no real title available?)
• A DNC function that computes no effectively bi-immune set
• Degrees of unsolvability of continuous functions
• Open questions about Ramsey-type statements in reverse mathematics
• Forcing with bushy trees
• Probabilistic inductive inference: A survey
• Mass problems associated with effectively closed sets
• Ramsey-type graph coloring and diagonal non-computability

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3469096)