@article{0282aefad0d94731a516276c0229d4c8,
title = "Complexity of the Isomorphism Problem for Computable Free Projective Planes of Finite Rank",
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 Δ0 3-set within the class.",
keywords = "computable representation, computable structure, free projective plane, isomorphism problem, projective plane, HOMOMORPHISMS, EMBEDDING PROBLEM",
author = "Kogabaev, {N. T.}",
year = "2018",
month = mar,
day = "1",
doi = "10.1134/S0037446618020131",
language = "English",
volume = "59",
pages = "295--308",
journal = "Siberian Mathematical Journal",
issn = "0037-4466",
publisher = "MAIK NAUKA/INTERPERIODICA/SPRINGER",
number = "2",
}