Email this article Complexity of the Isomorphism Problem for Computable Free Projective Planes of Finite Rank
- Authors: Kogabaev N.T.1
-
Affiliations:
- Sobolev Institute of Mathematics
- Issue: Vol 59, No 2 (2018)
- Pages: 295-308
- Section: Article
- URL: https://journals.rcsi.science/0037-4466/article/view/171780
- DOI: https://doi.org/10.1134/S0037446618020131
- ID: 171780
Cite item
Open Access
Access granted
Subscription Access
Abstract
Studying computable representations of projective planes, we prove that the isomorphism problem in the class of free projective planes of finite rank is an m-complete Δ03-set within the class.
About the authors
N. T. Kogabaev
Sobolev Institute of Mathematics
Author for correspondence.
Email: kogabaev@math.nsc.ru
Russian Federation, Novosibirsk
Supplementary files
