Algebra i logika
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


Algebra Logika:
Year:
Volume:
Issue:
Page:
Find




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

Algebra i logika, 2016, Volume 55, Number 4, Pages 432–440
DOI: https://doi.org/10.17377/alglog.2016.55.403 (Mi al750) 		 
$\Pi^1_1$-completeness of the computable categoricity problem for projective planes

N. T. Kogabaevab

a Sobolev Institute of Mathematics, pr. Akad. Koptyuga 4, Novosibirsk, 630090 Russia
b Novosibirsk State University, ul. Pirogova 2, Novosibirsk, 630090 Russia
Full-text PDF (141 kB)
References:
PDF
HTML
DOI: https://doi.org/10.17377/alglog.2016.55.403
Abstract: Computable presentations for projective planes are studied. We prove that the problem of computable categoricity is $\Pi^1_1$-complete for the following classes of projective planes: Pappian projective planes, Desarguesian projective planes, arbitrary projective planes.
Keywords: computable categoricity, computable structure, computable dimension, Desarguesian projective plane, Pappian projective plane, projective plane.
Funding agency Grant number
Ministry of Education and Science of the Russian Federation НШ-6848.2016.1
Russian Foundation for Basic Research 14-01-00376
Supported by the Grants Council (under RF President) for State Aid of Leading Scientific Schools (grant NSh-6848.2016.1) and by RFBR (project No. 14-01-00376).
Received: 27.04.2016
Revised: 24.06.2016
English version:
Algebra and Logic, 2016, Volume 55, Issue 4, Pages 283–288
DOI: https://doi.org/10.1007/s10469-016-9397-2
Bibliographic databases:
Document Type: Article
UDC: 510.53+514.146
Language: Russian
Citation: N. T. Kogabaev, “$\Pi^1_1$-completeness of the computable categoricity problem for projective planes”, Algebra Logika, 55:4 (2016), 432–440; Algebra and Logic, 55:4 (2016), 283–288
Citation in format AMSBIB
\Bibitem{Kog16}
\by N.~T.~Kogabaev
\paper $\Pi^1_1$-completeness of the computable categoricity problem
for projective planes
\jour Algebra Logika
\yr 2016
\vol 55
\issue 4
\pages 432--440
\mathnet{http://mi.mathnet.ru/al750}
\crossref{https://doi.org/10.17377/alglog.2016.55.403}
\transl
\jour Algebra and Logic
\yr 2016
\vol 55
\issue 4
\pages 283--288
\crossref{https://doi.org/10.1007/s10469-016-9397-2}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000388103400003}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84994753651}
Linking options:
  • https://www.mathnet.ru/eng/al750
  • https://www.mathnet.ru/eng/al/v55/i4/p432
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Алгебра и логика Algebra and Logic
    Statistics & downloads:
    Abstract page:241
    Full-text PDF :30
    References:49
    First page:9
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024