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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Goncharov S. S. and Knight J. F., “Computable structure and non-structure theorems,” Algebra and Logic, vol. 41, no. 6, 351–373 (2002).
Morozov A. S., “Functional trees and automorphisms of models,” Algebra and Logic, vol. 32, no. 1, 28–38 (1993).
Nies A., “Undecidable fragments of elementary theories,” Algebra Universalis, vol. 35, no. 1, 8–33 (1996).
Calvert W., “The isomorphism problem for classes of computable fields,” Arch. Math. Log., vol. 43, no. 3, 327–336 (2004).
Calvert W., “The isomorphism problem for computable Abelian p-groups of bounded length,” J. Symb. Log., vol. 70, no. 1, 331–345 (2005).
Downey R. and Montalbán A., “The isomorphism problem for torsion-free Abelian groups is analytic complete,” J. Algebra, vol. 320, no. 6, 2291–2300 (2008).
Carson J., Fokina E., Harizanov V. S., Knight J. F., Quinn S., Safranski C., and Wallbaum J., “The computable embedding problem,” Algebra and Logic, vol. 50, no. 6, 478–493 (2011).
Fokina E. B., Friedman S. D., Harizanov V., Knight J. F., McCoy C., and Montalbán A., “Isomorphism relations on computable structures,” J. Symb. Log., vol. 77, no. 1, 122–132 (2012).
Shirshov A. I. and Nikitin A. A., “Theory of projective planes,” Algebra and Logic, vol. 20, no. 3, 220–239 (1981).
Nikitin A. A., “Homomorphisms of freely generated projective planes,” Algebra and Logic, vol. 20, no. 4, 277–282 (1981).
Nikitin A. A., “On freely generated projective planes,” Algebra and Logic, vol. 22, no. 1, 45–57 (1983).
Nikitin A. A., “Some algorithmic problems for projective planes,” Algebra and Logic, vol. 23, no. 5, 347–358 (1984).
Shirshov A. I., “Ternar of a projective plane,” Algebra and Logic, vol. 24, no. 3, 240–244 (1985).
Vdovin V. V., “Homomorphisms of projective planes. I,” Sib. Math. J., vol. 27, no. 1, 26–34 (1986).
Vdovin V. V., “Homomorphisms of projective planes. II,” Sib. Math. J., vol. 27, no. 4, 498–502 (1986).
Vdovin V. V., “Simple projective planes,” Arch. Math., vol. 47, no. 5, 469–480 (1986).
Vdovin V. V., “Homomorphisms of freely generated projective planes,” Commun. Algebra, vol. 16, no. 11, 2209–2230 (1988).
Vdovin V. V., “Homomorphisms and algorithmic problems in projective planes,” Sib. Math. J., vol. 32, no. 6, 919–923 (1991).
Vdovin V. V., “Constructively presented projective planes,” Geom. Dedicata, vol. 39, no. 1, 115–123 (1991).
Kogabaev N. T., “Complexity of isomorphism problem for computable projective planes,” J. Math. Sci., vol. 203, no. 4, 509–515 (2014).
Kogabaev N. T., “The embedding problem for computable projective planes,” Algebra and Logic, vol. 56, no. 1, 75–79 (2017).
Ershov Yu. L. and Goncharov S. S., Constructive Models, Kluwer Academic/Plenum Publishers, New York, etc. (2000).
Ash C. J. and Knight J. F., Computable Structures and the Hyperarithmetical Hierarchy, Elsevier Sci. B.V., Amsterdam (2000).
Hughes D. R. and Piper F. C., Projective Planes, Springer-Verlag, New York, Heidelberg, and Berlin (1973).
Soare R. I., Recursively Enumerable Sets and Degrees, Springer-Verlag, Heidelberg (1987).
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text Copyright © 2018 Kogabaev N.T.
Rights and permissions
About this article
Cite this article
Kogabaev, N.T. Complexity of the Isomorphism Problem for Computable Free Projective Planes of Finite Rank. Sib Math J 59, 295–308 (2018). https://doi.org/10.1134/S0037446618020131
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0037446618020131