Every nonzero enumeration degree contains infinitely many singleton degrees

DOI10.1007/S10469-025-09804-2MaRDI QIDQ7253330zbMATH OpenFDO

Authors Thomas F. Kent, Keng Meng Ng, Andrea Sorbi

Publication date 27 May 2026

Published in Algebra and Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10469-025-09804-2

zbMATH Keywords

enumeration reducibilitysingleton reducibility

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Group theory and generalizations (20-XX)

Cites work

• A note on initial segments of the enumeration degrees
• Almost Recursivity and Partial Degrees
• e- and s-degrees
• Enumeration reducibilities
• Goodness in the enumeration and singleton degrees
• scientific article; zbMATH DE number 4160710 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• Irreducible, singular, and contiguous degrees
• On minimal pairs of enumeration degrees
• On restricted forms of enumeration reducibility
• On subcreative sets and S-reducibility
• Partial degrees and the density problem
• s-Degrees within e-Degrees
• The \(n\)-rea enumeration degrees are dense
• The structure of the s-degrees contained within a single e-degree

This page was built for publication: Every nonzero enumeration degree contains infinitely many singleton degrees

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