Low level nondefinability results: domination and recursive enumeration
From MaRDI portal
Publication:2869914
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
Cites work
- scientific article; zbMATH DE number 3861137 (Why is no real title available?)
- scientific article; zbMATH DE number 841084 (Why is no real title available?)
- A hyperimmune minimal degree and an ANR 2-minimal degree
- DIRECT AND LOCAL DEFINITIONS OF THE TURING JUMP
- Defining the Turing jump
- Dynamic notions of genericity and array noncomputability
- Jump embeddings in the Turing degrees
- Minimal degrees which are Σ₂⁰ but not Δ₂⁰
- On degrees of recursive unsolvability
- The Degrees of Hyperimmune Sets
Cited in
(3)
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)