Recursively enumerable many-one degrees
From MaRDI portal
Cited in
(14)- Relationships Between Reducibilities
- Minimal weak truth table degrees and computably enumerable Turing degrees
- Low sets without subsets of higher many-one degree
- Undecidable fragments of elementary theories
- 1994 Annual Meeting of the Association for Symbolic Logic
- On recursively enumerable structures
- Annual meeting of the Association for Symbolic Logic, Notre Dame, 1993
- Upper Semilattices in Many-One Degrees
- Recursively enumerable sets and degrees
- The undecidability of the Π4-theory for the r.e. wtt and Turing degrees
- On varieties all groups of which have a property close to solvability
- Positive equivalences
- On Σ1 1 equivalence relations over the natural numbers
- The problem of spectra of solvability for varieties of algebras
This page was built for publication: Recursively enumerable many-one degrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1845719)