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, 2021, Volume 60, Number 3, Pages 303–312 (Mi al2665)  
This article is cited in 2 scientific papers (total in 2 papers)

The degree of decidable categoricity of a model with infinite solutions for complete formulas

S. S. Goncharovab, M. I. Marchuka

a Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk
b Novosibirsk State University
Full-text PDF (223 kB) Citations (2)
References:
PDF
HTML
Abstract: We construct a decidable prime model in which the degree of a set of complete formulas is equal to $\mathbf{0}'$, infinitely many tuples of elements comply with every complete formula, and the decidable categoricity spectrum coincides with the set of all $PA$-degrees.
Keywords: computable model, decidable model, computable categoricity, autostability relative to strong constructivizations, degree of decidable categoricity, decidable categoricity spectrum, $PA$-degree.
Funding agency Grant number
Ministry of Science and Higher Education of the Russian Federation 075-15-2019-1613
Russian Foundation for Basic Research 20-01-00300
Supported by RFBR, project No. 20-01-00300. Supported byMathematical Center in Akademgorodok, Agreement with RFMinistry of Education and Science No. 075-15-2019-1613.
Received: 15.07.2021
Revised: 18.10.2021
English version:
Algebra and Logic, 2021, Volume 60, Issue 3, Pages 200–206
DOI: https://doi.org/10.1007/s10469-021-09642-y
Bibliographic databases:
Document Type: Article
UDC: 510.5+512.563
Language: Russian
Citation: S. S. Goncharov, M. I. Marchuk, “The degree of decidable categoricity of a model with infinite solutions for complete formulas”, Algebra Logika, 60:3 (2021), 303–312; Algebra and Logic, 60:3 (2021), 200–206
Citation in format AMSBIB
\Bibitem{GonMar21}
\by S.~S.~Goncharov, M.~I.~Marchuk
\paper The degree of decidable categoricity of a model with infinite solutions for complete formulas
\jour Algebra Logika
\yr 2021
\vol 60
\issue 3
\pages 303--312
\mathnet{http://mi.mathnet.ru/al2665}
\transl
\jour Algebra and Logic
\yr 2021
\vol 60
\issue 3
\pages 200--206
\crossref{https://doi.org/10.1007/s10469-021-09642-y}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000714533400010}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85118544308}
Linking options:
  • https://www.mathnet.ru/eng/al2665
  • https://www.mathnet.ru/eng/al/v60/i3/p303
    • This publication is cited in the following 2 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:197
    Full-text PDF :37
    References:34
    First page:4
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024