Vestnik Novosibirskogo Gosudarstvennogo Universiteta. Seriya Matematika, Mekhanika, Informatika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Sib. J. Pure and Appl. Math.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Vestnik Novosibirskogo Gosudarstvennogo Universiteta. Seriya Matematika, Mekhanika, Informatika, 2013, Volume 13, Issue 1, Pages 68–75 (Mi vngu131)  
This article is cited in 3 scientific papers (total in 3 papers)

The complexity of isomorphism problem for computable projective planes

N. T. Kogabaevab

a Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk, Russia
b Novosibirsk State University, Novosibirsk, Russia
Full-text PDF (210 kB) Citations (3)
References:
PDF
HTML
Abstract: Computable presentations for projective planes are studied. We prove that the isomorphism problem is $\Sigma^1_1$ complete for the following classes of projective planes: pappian projective planes, desarguesian projective planes, arbitrary projective planes.
Keywords: projective plane, pappian projective plane, desarguesian projective plane, computable model, isomorphism problem.
Received: 07.05.2012
English version:
Journal of Mathematical Sciences, 2014, Volume 203, Issue 4, Pages 509–515
DOI: https://doi.org/10.1007/s10958-014-2154-y
Document Type: Article
UDC: 510.53+514.146
Language: Russian
Citation: N. T. Kogabaev, “The complexity of isomorphism problem for computable projective planes”, Vestn. Novosib. Gos. Univ., Ser. Mat. Mekh. Inform., 13:1 (2013), 68–75; J. Math. Sci., 203:4 (2014), 509–515
Citation in format AMSBIB
\Bibitem{Kog13}
\by N.~T.~Kogabaev
\paper The complexity of isomorphism problem for computable projective planes
\jour Vestn. Novosib. Gos. Univ., Ser. Mat. Mekh. Inform.
\yr 2013
\vol 13
\issue 1
\pages 68--75
\mathnet{http://mi.mathnet.ru/vngu131}
\transl
\jour J. Math. Sci.
\yr 2014
\vol 203
\issue 4
\pages 509--515
\crossref{https://doi.org/10.1007/s10958-014-2154-y}
Linking options:
  • https://www.mathnet.ru/eng/vngu131
  • https://www.mathnet.ru/eng/vngu/v13/i1/p68
    • This publication is cited in the following 3 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Вестник Новосибирского государственного университета. Серия: математика, механика, информатика
    Statistics & downloads:
    Abstract page:285
    Full-text PDF :72
    References:48
    First page:18
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024