arXiv (All)
open access
A strengthened form of Dëgtev's argument and $D$-maximal many-one degrees
Dëgtev proved that if a noncomputable computably enumerable set \(U\) satisfies his property \((R)\) and the many-one degree of \(U\) contains no simple set, then the \(1\)-degree of \(U\) is minimal. We show that his proof yields the stronger conclusion that, for every noncomputable \(A\lem U\), \[
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- A strengthened form of Dëgtev's argument and $D$-maximal many-one degrees#920898
- The Basic Laws of Cardinal Number#739430
- Optimal polynomial meshes beyond geometric boundary regularity via Green sublevels#780921
- Optimal polynomial meshes beyond geometric boundary regularity via Green sublevels#779546
- Formal Arithmetic Before Grundgesetze#739410
Record · ID 925132
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive