On Kalimullin pairs

DOI10.3233/COM-150046zbMath1401.03076MaRDI QIDQ5740204

Joseph S. Miller, Steffen Lempp, Mingzhong Cai, Mariya Ivanova Soskova

Publication date: 25 July 2016

Published in: Computability (Search for Journal in Brave)

zbMATH Keywords

genericityenumeration reducibilityKalimullin pairs

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Cites Work

• Unnamed Item
• Defining the Turing jump
• Partial degrees and the density problem. Part 2: The enumeration degrees of the Σ₂ sets are dense
• Jumps of quasi-minimal enumeration degrees
• DEFINABILITY OF THE JUMP OPERATOR IN THE ENUMERATION DEGREES
• Interpreting true arithmetic in the local structure of the enumeration degrees
• Definability via Kalimullin pairs in the structure of the enumeration degrees
• Cupping and definability in the local structure of the enumeration degrees
• Semirecursive Sets and Positive Reducibility

This page was built for publication: On Kalimullin pairs