Email this article ∏11-Completeness of the Computable Categoricity Problem for Projective Planes
- Authors: Kogabaev N.T.1,2
-
Affiliations:
- Sobolev Institute of Mathematics
- Novosibirsk State University
- Issue: Vol 55, No 4 (2016)
- Pages: 283-288
- Section: Article
- URL: https://journals.rcsi.science/0002-5232/article/view/233992
- DOI: https://doi.org/10.1007/s10469-016-9397-2
- ID: 233992
Cite item
Open Access
Access granted
Subscription Access
Abstract
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.
About the authors
N. T. Kogabaev
Sobolev Institute of Mathematics; Novosibirsk State University
Author for correspondence.
Email: kogabaev@math.nsc.ru
Russian Federation, pr. Akad. Koptyuga 4, Novosibirsk, 630090; ul. Pirogova 2, Novosibirsk, 630090
Supplementary files
