Low level nondefinability results: domination and recursive enumeration

DOI10.2178/JSL.7803180zbMATH Open1325.03047OpenAlexW2050725079MaRDI QIDQ2869914FDOQ2869914

Authors: 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

Recommendations

• DIRECT AND LOCAL DEFINITIONS OF THE TURING JUMP
• The jump is definable in the structure of the degrees of unsolvability
• The search for natural definability in the Turing degrees
• Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers
• scientific article; zbMATH DE number 2204762
• A splitting theorem for \(n\)-REA degrees
• On the First Order Theory of the Arithmetical Degrees
• A Refinement of Lown and Highn for the R.E. Degrees
• Definability in the Recursively Enumerable Degrees
• Decidability and undecidability in the enumerable Turing degrees

zbMATH Keywords

Turing degreesnondefinabilty

Mathematics Subject Classification ID

Other Turing degree structures (03D28)

Cites Work

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

Cited In (3)

• Title not available (Why is that?)
• PARAMETER DEFINABILITY IN THE RECURSIVELY ENUMERABLE DEGREES
• Defining totality in the enumeration degrees

This page was built for publication: Low level nondefinability results: domination and recursive enumeration

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