Hierarchy of Computably Enumerable Degrees II

DOI10.53733/133MaRDI QIDQ3380356zbMATH OpenOpenAlexFDO

Authors Noam Greenberg, Ellen Hammatt, Rodney G. Downey

Publication date 28 September 2021

Published in New Zealand Journal of Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.53733/133

zbMATH Keywords

hierarchiesdegrees of unsolvabilityreducibilities

Mathematics Subject Classification ID

Associative rings and algebras (16-XX) Mathematical logic and foundations (03-XX)

Recommendations

• A hierarchy of computably enumerable degrees
• Theory and Applications of Models of Computation
• Maximality and collapse in the hierarchy of \(\alpha\)-c.a. degrees
• Splitting and jump inversion in the Turing degrees
• On the problem of definability of the computably enumerable degrees in the difference hierarchy

Cites work

• scientific article; zbMATH DE number 4172959 (Why is no real title available?)
• scientific article; zbMATH DE number 3117565 (Why is no real title available?)
• scientific article; zbMATH DE number 3861137 (Why is no real title available?)
• scientific article; zbMATH DE number 2063218 (Why is no real title available?)
• scientific article; zbMATH DE number 1531934 (Why is no real title available?)
• scientific article; zbMATH DE number 841084 (Why is no real title available?)
• scientific article; zbMATH DE number 969633 (Why is no real title available?)
• scientific article; zbMATH DE number 2204767 (Why is no real title available?)
• scientific article; zbMATH DE number 3342830 (Why is no real title available?)
• scientific article; zbMATH DE number 3342831 (Why is no real title available?)
• scientific article; zbMATH DE number 3404227 (Why is no real title available?)
• scientific article; zbMATH DE number 2216723 (Why is no real title available?)
• A Hierarchy of Turing Degrees
• A finite lattice without critical triple that cannot be embedded into the enumerable Turing degrees
• A hierarchy of computably enumerable degrees
• Algorithmic randomness and complexity.
• An Algebraic Decomposition of the Recursively Enumerable Degrees and the Coincidence of Several Degree Classes with the Promptly Simple Degrees
• Automorphisms of the Lattice of Recursively Enumerable Sets: Promptly Simple Sets
• Automorphisms of the lattice of recursively enumerable sets. I: Maximal sets
• Bounded randomness
• Classes of Recursively Enumerable Sets and Degrees of Unsolvability
• Contiguity and distributivity in the enumerable Turing degrees
• Cuppability of simple and hypersimple sets
• Degree theoretic definitions of the low₂ recursively enumerable sets
• Embedding finite lattices into the computably enumerable degrees -- a status survey
• Hypersimplicity and semicomputability in the weak truth table degrees
• Interpretability and Definability in the Recursively Enumerable Degrees
• Lattice nonembeddings and initial segments of the recursively enumerable degrees
• Lowness and logical depth
• Lowness properties and randomness
• Mathematical logic.
• Maximal contiguous degrees
• Not every finite lattice is embeddable in the recursively enumerable degrees
• Notions of weak genericity
• On Computable Numbers, with an Application to the Entscheidungsproblem
• Post's Programme for the Ershov Hierarchy
• Post's program and incomplete recursively enumerable sets.
• Randomness, relativization and Turing degrees
• Reals which compute little
• Recursively enumerable sets and degrees
• Recursively enumerable sets of positive integers and their decision problems
• Splitting into degrees with low computational strength
• Strong jump-traceability
• T-Degrees, Jump Classes, and Strong Reducibilities
• TOTALLY ω-COMPUTABLY ENUMERABLE DEGREES AND BOUNDING CRITICAL TRIPLES
• TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
• The infinite injury priority method
• Theory and Applications of Models of Computation
• Two theorems on many-one degrees of recursively enumerable sets
• Working with strong reducibilities above totally \(\omega \)-c.e. and array computable degrees
• Π₁⁰ classes and strong degree spectra of relations

Cited in

(4)

• The natural hierarchy and quasi-hierarchy of constructibility degrees
• A Hierarchy of Turing Degrees
• A hierarchy of families of recursively enumerable degrees
• The partial orderings of the computably enumerable ibT-degrees and cl-degrees are not elementarily equivalent

This page was built for publication: Hierarchy of Computably Enumerable Degrees II

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