电邮这篇文章 ∏11-Completeness of the Computable Categoricity Problem for Projective Planes
- 作者: Kogabaev N.T.1,2
-
隶属关系:
- Sobolev Institute of Mathematics
- Novosibirsk State University
- 期: 卷 55, 编号 4 (2016)
- 页面: 283-288
- 栏目: Article
- URL: https://journal-vniispk.ru/0002-5232/article/view/233992
- DOI: https://doi.org/10.1007/s10469-016-9397-2
- ID: 233992
如何引用文章
开放存取
##reader.subscriptionAccessGranted##
订阅存取
详细
Computable presentations for projective planes are studied. We prove that the problem of computable categoricity is ∏11-complete for the following classes of projective planes: Pappian projective planes, Desarguesian projective planes, arbitrary projective planes.
作者简介
N. Kogabaev
Sobolev Institute of Mathematics; Novosibirsk State University
编辑信件的主要联系方式.
Email: kogabaev@math.nsc.ru
俄罗斯联邦, pr. Akad. Koptyuga 4, Novosibirsk, 630090; ul. Pirogova 2, Novosibirsk, 630090
补充文件
