Sibirskii Matematicheskii Zhurnal
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Sibirsk. Mat. Zh.:
Year:
Volume:
Issue:
Page:
Find




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

Sibirskii Matematicheskii Zhurnal, 2018, Volume 59, Number 2, Pages 378–395
DOI: https://doi.org/10.17377/smzh.2018.59.213 (Mi smj2980) 		 
This article is cited in 1 scientific paper (total in 1 paper)

Complexity of the isomorphism problem for computable free projective planes of finite rank

N. T. Kogabaevab

a Sobolev Institute of Mathematics, Novosibirsk, Russia
b Novosibirsk State University, Novosibirsk, Russia
Full-text PDF (388 kB) Citations (1)
References:
PDF
HTML
DOI: https://doi.org/10.17377/smzh.2018.59.213
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 $\Delta^0_3$-set within the class.
Keywords: computable structure, computable representation, isomorphism problem, projective plane, free projective plane.
Funding agency Grant number
Ministry of Education and Science of the Russian Federation НШ-5913.2018.1
Russian Foundation for Basic Research 17-01-00247
The author was supported by the State Maintenance Program for the Leading Scientific Schools of the Russian Federation (Grant NSh-5913.2018.1) and the Russian Foundation for Basic Research (Grant 17-01-00247).
Received: 18.05.2017
English version:
Siberian Mathematical Journal, 2018, Volume 59, Issue 2, Pages 295–308
DOI: https://doi.org/10.1134/S0037446618020131
Bibliographic databases:
Document Type: Article
UDC: 510.53+514.146
MSC: 35R30
Language: Russian
Citation: N. T. Kogabaev, “Complexity of the isomorphism problem for computable free projective planes of finite rank”, Sibirsk. Mat. Zh., 59:2 (2018), 378–395; Siberian Math. J., 59:2 (2018), 295–308
Citation in format AMSBIB
\Bibitem{Kog18}
\by N.~T.~Kogabaev
\paper Complexity of the isomorphism problem for computable free projective planes of finite rank
\jour Sibirsk. Mat. Zh.
\yr 2018
\vol 59
\issue 2
\pages 378--395
\mathnet{http://mi.mathnet.ru/smj2980}
\crossref{https://doi.org/10.17377/smzh.2018.59.213}
\elib{https://elibrary.ru/item.asp?id=32817970}
\transl
\jour Siberian Math. J.
\yr 2018
\vol 59
\issue 2
\pages 295--308
\crossref{https://doi.org/10.1134/S0037446618020131}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000430858600013}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85046639587}
Linking options:
  • https://www.mathnet.ru/eng/smj2980
  • https://www.mathnet.ru/eng/smj/v59/i2/p378
    • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Сибирский математический журнал Siberian Mathematical Journal
    Statistics & downloads:
    Abstract page:231
    Full-text PDF :59
    References:29
    First page:5
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024