Every nonzero enumeration degree contains infinitely many singleton degrees

Extending a result of Zacharov, we show that every nonzero enumeration degree consists of infinitely many s-degrees. In fact we show that there is no minimal s-degree inside any nonzero enumeration degree. This answers open questions in the literature raised by Cooper and Batyrshin.

Publication Details

Journal
Use Siena air (University of Siena)
Published
2025-01-01
Primary Topic
Computability, Logic, AI Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Every nonzero enumeration degree contains infinitely many singleton degrees

Use Siena air (University of Siena)
Computability, Logic, AI Algorithms
article

Every nonzero enumeration degree contains infinitely many singleton degrees

article en

Abstract

Extending a result of Zacharov, we show that every nonzero enumeration degree consists of infinitely many s-degrees. In fact we show that there is no minimal s-degree inside any nonzero enumeration degree. This answers open questions in the literature raised by Cooper and Batyrshin.

Use Siena air (University of Siena)
Openalex Percentile: Top 46%
Computability, Logic, AI Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Every nonzero enumeration degree contains infinitely many singleton degrees · Use Siena air (University of Siena) (2025) | TGRS Research Map | TGRS