Hierarchy of Computably Enumerable Degrees II

Cites Work

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

Cited In (4)

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

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)