2-minimality, jump classes and a note on natural definability

DOI10.1016/J.APAL.2013.10.005zbMATH Open1323.03055OpenAlexW1984169197MaRDI QIDQ386644FDOQ386644

Authors: Mingzhong Cai 

Publication date: 10 December 2013

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2013.10.005

Recommendations

• Logical Approaches to Computational Barriers
• Degrees which do not bound minimal degrees
• Jumps of quasi-minimal enumeration degrees
• Jumps of Minimal Degrees Below 0 ′
• Properties of the jump classes

zbMATH Keywords

tree system2-minimalgeneralized high degreejump class

Mathematics Subject Classification ID

Other Turing degree structures (03D28)

Cites Work

• Title not available (Why is that?)
• Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers
• Degrees which do not bound minimal degrees
• Defining the Turing jump
• A 2-MINIMAL NON-GL₂ DEGREE
• Title not available (Why is that?)
• DIRECT AND LOCAL DEFINITIONS OF THE TURING JUMP
• Joining up to the generalized high degrees
• Strong minimal covers and a question of Yates: the story so far
• Minimal degrees and the jump operator
• Simple Proofs of Some Theorems on High Degrees of Unsolvability
• Double jumps of minimal degrees
• Some Special Pairs of Σ2 e-Degrees
• Generalized high degrees have the complementation property
• A hyperimmune minimal degree and an ANR 2-minimal degree
• Characterizing the join-irreducible Medvedev degrees

Cited In (3)

• Degrees which do not bound minimal degrees
• Properties of the jump classes
• DNR and incomparable Turing degrees

This page was built for publication: 2-minimality, jump classes and a note on natural definability

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