On the definable ideal generated by nonbounding c.e. degrees

DOI10.2178/JSL/1107298519zbMath1093.03027OpenAlexW2087604897MaRDI QIDQ3370764

Yue Yang, Liang Yu

Publication date: 8 February 2006

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2178/jsl/1107298519

zbMATH Keywords

cappable c.e. degreenoncuppable c.e. degree

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Related Items (3)

On definable filters in computably enumerable degrees ⋮ On the definable ideal generated by the plus cupping c.e. degrees ⋮ Upper bounds on ideals in the computably enumerable Turing degrees

Cites Work

• Logic year 1979--80, The University of Connecticut, USA
• The recursively enumerable degrees have infinitely many one-types
• Definability in the Recursively Enumerable Degrees
• Interpretability and Definability in the Recursively Enumerable Degrees
• PARAMETER DEFINABILITY IN THE RECURSIVELY ENUMERABLE DEGREES

This page was built for publication: On the definable ideal generated by nonbounding c.e. degrees