MUCHNIK DEGREES AND CARDINAL CHARACTERISTICS

DOI10.1017/jsl.2020.1zbMath1485.03160arXiv1712.00864OpenAlexW2771979056MaRDI QIDQ5159485

Benoit Monin, André Nies

Publication date: 27 October 2021

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1712.00864

zbMATH Keywords

cardinal characteristicsMedvedev reducibilityMuchnik reducibilitymass problemTuring functional \(\Gamma\)

Mathematics Subject Classification ID

Cardinal characteristics of the continuum (03E17) Applications of computability and recursion theory (03D80) Other degrees and reducibilities in computability and recursion theory (03D30) Other Turing degree structures (03D28)

Related Items (1)

Martin-Löf random quantum states

Cites Work

• Unnamed Item
• Unnamed Item
• Computability and complexity. Essays dedicated to Rodney G. Downey on the occasion of his 60th birthday
• The gamma question for many-one degrees
• Relativized Schnorr tests with universal behavior
• Many different covering numbers of Yorioka's ideals
• Asymptotic density and the coarse computability bound
• An Analogy between Cardinal Characteristics and Highness Properties of Oracles
• Combinatorial Cardinal Characteristics of the Continuum
• Kolmogorov complexity and the Recursion Theorem
• Asymptotic density, computable traceability, and 1-randomness
• Error-correcting codes for list decoding
• A Unifying Approach to the Gamma Question
• An answer to the Gamma question
• Cardinal invariants, non-lowness classes, and Weihrauch reducibility
• FORCING WITH BUSHY TREES

This page was built for publication: MUCHNIK DEGREES AND CARDINAL CHARACTERISTICS