Cappable recursively enumerable degrees and Post's program
From MaRDI portal
Recommendations
- Post's program and incomplete recursively enumerable sets.
- A Cappable Almost Everywhere Dominating Computably Enumerable Degree
- Bounded recursively enumerable sets and degrees
- Publication:4863251
- scientific article; zbMATH DE number 4057497
- Definability in the Recursively Enumerable Degrees
- Relative recursive enumerability of generic degrees
- Publication:4934281
- On Pairs of Recursively Enumerable Degrees
- scientific article; zbMATH DE number 3845569
Cites work
- scientific article; zbMATH DE number 4091484 (Why is no real title available?)
- A minimal pair of recursively enumerable degrees
- An Algebraic Decomposition of the Recursively Enumerable Degrees and the Coincidence of Several Degree Classes with the Promptly Simple Degrees
- Computational complexity, speedable and levelable sets
- Cupping and noncapping in the r.e. weak truth table and turing degrees
- Lower Bounds for Pairs of Recursively Enumerable Degrees
- One class of partial sets
- Post's program and incomplete recursively enumerable sets.
- Recursively enumerable sets of positive integers and their decision problems
- Strong reducibilities
- Structural interactions of the recursively enumerable T- and W-degrees
- Three theorems on the degrees of recursively enumerable sets
Cited in
(6)
This page was built for publication: Cappable recursively enumerable degrees and Post's program
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1311427)