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, 2009, Volume 48, Number 5, Pages 564–579 (Mi al414)  

This article is cited in 11 scientific papers (total in 11 papers)

Initial segments of computable linear orders with additional computable predicates

M. V. Zubkov

N. G. Chebotarev Research Institute of Mathematics and Mechanics, Kazan State University, Kazan, Russia
References:
Abstract: We study computable linear orders with computable neighborhood and block predicates. In particular, it is proved that there exists a computable linear order with a computable neighborhood predicate, having a $\Pi^0_1$-initial segment which is isomorphic to no computable order with a computable neighborhood predicate. On the other hand, every $\Sigma^0_1$-initial segment of such an order has a computable copy enjoying a computable neighborhood predicate.
Similar results are stated for computable linear orders with a computable block predicate replacing a neighborhood relation. Moreover, using the results obtained, we give a simpler proof for the Coles–Downey–Khoussainov theorem on the existence of a computable linear order with $\Pi^0_2$-initial segment, not having a computable copy.
Keywords: computability, recursiveness, linear order, initial segment.
Received: 24.01.2008
Revised: 20.03.2009
English version:
Algebra and Logic, 2009, Volume 48, Issue 5, Pages 321–329
DOI: https://doi.org/10.1007/s10469-009-9068-7
Bibliographic databases:
UDC: 510.53+512.562
Language: Russian
Citation: M. V. Zubkov, “Initial segments of computable linear orders with additional computable predicates”, Algebra Logika, 48:5 (2009), 564–579; Algebra and Logic, 48:5 (2009), 321–329
Citation in format AMSBIB
\Bibitem{Zub09}
\by M.~V.~Zubkov
\paper Initial segments of computable linear orders with additional computable predicates
\jour Algebra Logika
\yr 2009
\vol 48
\issue 5
\pages 564--579
\mathnet{http://mi.mathnet.ru/al414}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2640956}
\zmath{https://zbmath.org/?q=an:1241.03056}
\transl
\jour Algebra and Logic
\yr 2009
\vol 48
\issue 5
\pages 321--329
\crossref{https://doi.org/10.1007/s10469-009-9068-7}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000272173200002}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-70949106263}
Linking options:
  • https://www.mathnet.ru/eng/al414
  • https://www.mathnet.ru/eng/al/v48/i5/p564
  • This publication is cited in the following 11 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:331
    Full-text PDF :99
    References:71
    First page:4
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024