Cappable recursively enumerable degrees and Post's program
From MaRDI portal
Publication:1311427
DOI10.1007/BF01270394zbMath0791.03020OpenAlexW2019258373MaRDI QIDQ1311427
André Nies, Ambos-Spies, Klaus
Publication date: 13 January 1994
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01270394
Related Items (1)
Cites Work
- Unnamed Item
- Structural interactions of the recursively enumerable T- and W-degrees
- One class of partial sets
- Three theorems on the degrees of recursively enumerable sets
- An Algebraic Decomposition of the Recursively Enumerable Degrees and the Coincidence of Several Degree Classes with the Promptly Simple Degrees
- Cupping and noncapping in the r.e. weak truth table and turing degrees
- Strong reducibilities
- Post's program and incomplete recursively enumerable sets.
- Computational complexity, speedable and levelable sets
- A minimal pair of recursively enumerable degrees
- Lower Bounds for Pairs of Recursively Enumerable Degrees
- Recursively enumerable sets of positive integers and their decision problems
This page was built for publication: Cappable recursively enumerable degrees and Post's program