scientific article; zbMATH DE number 3784859
From MaRDI portal
Publication:3962983
zbMATH Open0498.03029MaRDI QIDQ3962983FDOQ3962983
Authors: Peter A. Fejer, Robert I. Soare 
Publication date: 1981
Title of this publication is not available (Why is that?)
Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)
Cited In (5)
- On the definable ideal generated by the plus cupping c.e. degrees
- Non-bounding constructions
- A hierarchy for the plus cupping Turing degrees
- An Algebraic Decomposition of the Recursively Enumerable Degrees and the Coincidence of Several Degree Classes with the Promptly Simple Degrees
- Cupping and jump classes in the computably enumerable degrees
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3962983)
