FORCING WITH BUSHY TREES

DOI10.1017/bsl.2017.12zbMath1421.03021arXiv1503.08870OpenAlexW2963802191MaRDI QIDQ5363371

Joseph S. Miller, Mushfeq Khan

Publication date: 6 October 2017

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

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

zbMATH Keywords

minimal degreesalgorithmic randomnessbushy tree forcingdiagonally noncomputable functions

Mathematics Subject Classification ID

Other Turing degree structures (03D28) Algorithmic randomness and dimension (03D32) Hierarchies of computability and definability (03D55)

Related Items (12)

Shift-complex sequences ⋮ Covering the Recursive Sets ⋮ Degrees of Unsolvability: A Tutorial ⋮ Coloring trees in reverse mathematics ⋮ Ramsey-type graph coloring and diagonal non-computability ⋮ The coding power of a product of partitions ⋮ Effective Bi-immunity and Randomness ⋮ The weakness of being cohesive, thin or free in reverse mathematics ⋮ Covering the recursive sets ⋮ MUCHNIK DEGREES AND CARDINAL CHARACTERISTICS ⋮ Diagonally non-computable functions and fireworks ⋮ Highness properties close to PA completeness

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A DNC function that computes no effectively bi-immune set
• Binary subtrees with few labeled paths
• COMPARING THE STRENGTH OF DIAGONALLY NONRECURSIVE FUNCTIONS IN THE ABSENCE OF INDUCTION
• Diagonally Non-Computable Functions and Bi-Immunity
• Algorithmic Randomness and Complexity
• A fixed-point-free minimal degree
• Located sets and reverse mathematics
• Diagonally non-recursive functions and effective Hausdorff dimension
• Comparing DNR and WWKL

This page was built for publication: FORCING WITH BUSHY TREES