There is no ordering on the classes in the generalized high/low hierarchies

DOI10.1007/S00153-005-0304-0zbMath1099.03030OpenAlexW2018626936MaRDI QIDQ818520

Antonio Montalbán

Publication date: 21 March 2006

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00153-005-0304-0

zbMATH Keywords

decidabilityTuring degreesexistential theorygeneralized high/low hierarchy

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Other Turing degree structures (03D28) Hierarchies of computability and definability (03D55)

Related Items (1)

Implicit definability in arithmetic

Cites Work

• Unnamed Item
• Unnamed Item
• Degrees which do not bound minimal degrees
• Interpolation and embedding in the recursively enumerable degrees
• Jump embeddings in the Turing degrees
• Minimal pairs and high recursively enumerable degrees
• Simple Proofs of Some Theorems on High Degrees of Unsolvability
• Double jumps of minimal degrees
• Embedding jump upper semilattices into the Turing degrees
• Automorphisms of the lattice of recursively enumerable sets
• Generalized high degrees have the complementation property

This page was built for publication: There is no ordering on the classes in the generalized high/low hierarchies