On definable filters in computably enumerable degrees
From MaRDI portal
Publication:2370372
DOI10.1016/j.apal.2007.03.003zbMath1117.03049MaRDI QIDQ2370372
Publication date: 25 June 2007
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apal.2007.03.003
03D25: Recursively (computably) enumerable sets and degrees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the definable ideal generated by the plus cupping c.e. degrees
- Interpolation and embedding in the recursively enumerable degrees
- An Algebraic Decomposition of the Recursively Enumerable Degrees and the Coincidence of Several Degree Classes with the Promptly Simple Degrees
- On the definable ideal generated by nonbounding c.e. degrees
- An extension of the nondiamond theorem in classical and α-recursion theory
- A recursively enumerable degree which will not split over all lesser ones
- Lattice Embeddings into the R.E. Degrees Preserving 0 and 1
- Generalized nonsplitting in the recursively enumerable degrees
- PARAMETER DEFINABILITY IN THE RECURSIVELY ENUMERABLE DEGREES