电邮这篇文章 Computable Families of Sets in the Ershov Hierarchy Without Principal Numberings
- 作者: Ospichev S.S.1
-
隶属关系:
- Novosibirsk State University
- 期: 卷 215, 编号 4 (2016)
- 页面: 529-536
- 栏目: Article
- URL: https://bakhtiniada.ru/1072-3374/article/view/237643
- DOI: https://doi.org/10.1007/s10958-016-2857-3
- ID: 237643
如何引用文章
开放存取
##reader.subscriptionAccessGranted##
订阅存取
详细
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.
作者简介
S. Ospichev
Novosibirsk State University
编辑信件的主要联系方式.
Email: ospichev@ngs.ru
俄罗斯联邦, 2, ul. Pirogova, Novosibirsk, 630090
补充文件
