Email this article Computable Families of Sets in the Ershov Hierarchy Without Principal Numberings
- Authors: Ospichev S.S.1
-
Affiliations:
- Novosibirsk State University
- Issue: Vol 215, No 4 (2016)
- Pages: 529-536
- Section: Article
- URL: https://ogarev-online.ru/1072-3374/article/view/237643
- DOI: https://doi.org/10.1007/s10958-016-2857-3
- ID: 237643
Cite item
Open Access
Access granted
Subscription Access
Abstract
We construct an example of a computable family of sets that does not possess \( {\displaystyle {\sum}_{{}_a}^{-1}} \) -computable principal numberings for any a ϵ . Bibliography: 19 titles.
About the authors
S. S. Ospichev
Novosibirsk State University
Author for correspondence.
Email: ospichev@ngs.ru
Russian Federation, 2, ul. Pirogova, Novosibirsk, 630090
Supplementary files
