Low Level Nondelegability Results: Domination and Recursive Enumeration

DOI10.2178/jsl.7803180zbMath1325.03047OpenAlexW2050725079MaRDI QIDQ2869914

Mingzhong Cai, Richard A. Shore

Publication date: 7 January 2014

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

Full work available at URL: https://projecteuclid.org/euclid.jsl/1389032288

zbMATH Keywords

Turing degreesnondefinabilty

Mathematics Subject Classification ID

Other Turing degree structures (03D28)

Related Items (1)

Defining totality in the enumeration degrees

Cites Work

• Unnamed Item
• Unnamed Item
• A hyperimmune minimal degree and an ANR 2-minimal degree
• On degrees of recursive unsolvability
• Dynamic notions of genericity and array noncomputability
• Defining the Turing jump
• DIRECT AND LOCAL DEFINITIONS OF THE TURING JUMP
• Jump embeddings in the Turing degrees
• Minimal degrees which are Σ₂⁰ but not Δ₂⁰
• The Degrees of Hyperimmune Sets

This page was built for publication: Low Level Nondelegability Results: Domination and Recursive Enumeration