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 6, Pages 647–669
DOI: https://doi.org/10.17377/alglog.2016.55.601 (Mi al769) 		 
This article is cited in 34 scientific papers (total in 34 papers)

Structures computable in polynomial time. I

P. E. Alaevab

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 (224 kB) Citations (34)
References:
PDF
HTML
DOI: https://doi.org/10.17377/alglog.2016.55.601
Abstract: It is proved that every computable locally finite structure with finitely many functions has a presentation computable in polynomial time. Furthermore, a structure computable in polynomial time is polynomially categorical iff it is finite. If a structure is computable in polynomial time and locally finite then it is weakly polynomially categorical (i.e., categorical with respect to primitive recursive isomorphisms) iff it is finite.
Keywords: locally finite structure, computable structure, structure computable in polynomial time, polynomially categorical structure, weakly polynomially categorical structure.
Funding agency Grant number
Russian Foundation for Basic Research 14-01-00376
Supported by RFBR, project No. 14-01-00376.
Received: 09.11.2015
Revised: 07.12.2015
English version:
Algebra and Logic, 2017, Volume 55, Issue 6, Pages 421–435
DOI: https://doi.org/10.1007/s10469-017-9416-y
Bibliographic databases:
Document Type: Article
UDC: 510.5+512+510.6
Language: Russian
Citation: P. E. Alaev, “Structures computable in polynomial time. I”, Algebra Logika, 55:6 (2016), 647–669; Algebra and Logic, 55:6 (2017), 421–435
Citation in format AMSBIB
\Bibitem{Ala16}
\by P.~E.~Alaev
\paper Structures computable in polynomial time.~I
\jour Algebra Logika
\yr 2016
\vol 55
\issue 6
\pages 647--669
\mathnet{http://mi.mathnet.ru/al769}
\crossref{https://doi.org/10.17377/alglog.2016.55.601}
\transl
\jour Algebra and Logic
\yr 2017
\vol 55
\issue 6
\pages 421--435
\crossref{https://doi.org/10.1007/s10469-017-9416-y}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000396462200001}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85015091737}
Linking options:
  • https://www.mathnet.ru/eng/al769
  • https://www.mathnet.ru/eng/al/v55/i6/p647
    Cycle of papers
    This publication is cited in the following 34 articles:
    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:364
    Full-text PDF :160
    References:54
    First page:19
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024