On definable filters in computably enumerable degrees
From MaRDI portal
Publication:2370372
Recommendations
Cites work
- A recursively enumerable degree which will not split over all lesser ones
- An Algebraic Decomposition of the Recursively Enumerable Degrees and the Coincidence of Several Degree Classes with the Promptly Simple Degrees
- An extension of the nondiamond theorem in classical and α-recursion theory
- Generalized nonsplitting in the recursively enumerable degrees
- scientific article; zbMATH DE number 4091484 (Why is no real title available?)
- scientific article; zbMATH DE number 3598539 (Why is no real title available?)
- scientific article; zbMATH DE number 1531934 (Why is no real title available?)
- scientific article; zbMATH DE number 218585 (Why is no real title available?)
- Interpolation and embedding in the recursively enumerable degrees
- Lattice Embeddings into the R.E. Degrees Preserving 0 and 1
- On the definable ideal generated by nonbounding c.e. degrees
- On the definable ideal generated by the plus cupping c.e. degrees
- PARAMETER DEFINABILITY IN THE RECURSIVELY ENUMERABLE DEGREES
Cited in
(4)
This page was built for publication: On definable filters in computably enumerable degrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2370372)