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

DOI10.2178/JSL/1107298519zbMATH Open1093.03027OpenAlexW2087604897MaRDI QIDQ3370764FDOQ3370764

Authors: Liang Yu, Yue Yang 

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

Recommendations

• On the definable ideal generated by the plus cupping c.e. degrees
• Theory and Applications of Models of Computation
• scientific article; zbMATH DE number 1126845
• scientific article; zbMATH DE number 4079575
• Finite determinacy relative to closed and finitely generated ideals
• scientific article; zbMATH DE number 32738
• Definability and initial segments of c-degrees
• scientific article; zbMATH DE number 1531930
• On Borel fixed ideals generated in one degree
• A note on upper bounds for ideal-theoretic problems

zbMATH Keywords

cappable c.e. degreenoncuppable c.e. degree

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (3)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3370764)