2003 | OriginalPaper | Buchkapitel
Completeness and Universality of Arithmetical Numberings
verfasst von : Serikzhan Badaev, Sergey Goncharov, Andrea Sorbi
Erschienen in: Computability and Models
Verlag: Springer US
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
We investigate completeness and universality notions, relative to different oracles, and the interconnection between these notions, with applications to arithmetical numberings. We prove that principal numberings are complete; completeness is independent of the oracle; the degree of any incomplete numbering is meet-reducible, uniformly complete numberings exist. We completely characterize which finite arithmetical families have a universal numbering.