There exists a maximal 3-c.e. enumeration degree
From MaRDI portal
Publication:2382237
Recommendations
Cites work
- A minimal degree less than 0’
- Computing degrees of unsolvability
- Density results in the _2⁰ e-degrees
- scientific article; zbMATH DE number 4160710 (Why is no real title available?)
- scientific article; zbMATH DE number 3732038 (Why is no real title available?)
- scientific article; zbMATH DE number 1531918 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- scientific article; zbMATH DE number 3342830 (Why is no real title available?)
- scientific article; zbMATH DE number 3342831 (Why is no real title available?)
- Note on Degrees of Partial Functions
- On degrees of recursive unsolvability
- On minimal pairs of enumeration degrees
- Partial degrees and the density problem
- Partial degrees and the density problem. Part 2: The enumeration degrees of the Σ2 sets are dense
- Reducibility and Completeness for Sets of Integers
- Splitting properties of n-c.e. enumeration degrees
- The \(n\)-rea enumeration degrees are dense
- The d.r.e. degrees are not dense
- The recursively enumerable degrees are dense
- The Π20 enumeration degrees are not dense
- Trial and error predicates and the solution to a problem of Mostowski
Cited in
(3)
This page was built for publication: There exists a maximal 3-c.e. enumeration degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2382237)