Algebra i logika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Subscription

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 Logika, 2019, Volume 58, Number 4, Pages 528–541 (Mi al914)  

This article is cited in 1 scientific paper (total in 1 paper)

Khutoretskii's theorem for generalized computable families

M. Kh. Faizrakhmanov

Kazan (Volga Region) Federal University

Abstract: We give sufficient conditions for generalized computable numberings to satisfy the statement of Khutoretskii's theorem. This implies limitedness of universal $\Sigma^0_\alpha$-computable numberings for $2\leqslant\alpha< \omega^{CK}_1$.

Keywords: generalized computable family, generalized computable numbering, Khutoretskii's theorem.

Funding Agency Grant Number
Ministry of Education and Science of the Russian Federation 1.1515.2017/4.6
The work was carried out at the expense of the subsidy allocated to Kazan (Volga Region) Federal University for the fulfillment of the state task in the sphere of scientific activity, project No. 1.1515.2017/4.6.


DOI: https://doi.org/10.33048/alglog.2019.58.408

Full text: PDF file (241 kB)
First page: PDF file
References: PDF file   HTML file

English version:
Algebra and Logic, 2019, 58:4, 356–365

Bibliographic databases:

UDC: 510.5
Received: 20.04.2018
Revised: 08.11.2019

Citation: M. Kh. Faizrakhmanov, “Khutoretskii's theorem for generalized computable families”, Algebra Logika, 58:4 (2019), 528–541; Algebra and Logic, 58:4 (2019), 356–365

Citation in format AMSBIB
\Bibitem{Fai19}
\by M.~Kh.~Faizrakhmanov
\paper Khutoretskii's theorem for generalized computable families
\jour Algebra Logika
\yr 2019
\vol 58
\issue 4
\pages 528--541
\mathnet{http://mi.mathnet.ru/al914}
\crossref{https://doi.org/10.33048/alglog.2019.58.408}
\transl
\jour Algebra and Logic
\yr 2019
\vol 58
\issue 4
\pages 356--365
\crossref{https://doi.org/10.1007/s10469-019-09557-9}
\isi{http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&DestLinkType=FullRecord&DestApp=ALL_WOS&KeyUT=000501536600008}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85075485118}


Linking options:
  • http://mi.mathnet.ru/eng/al914
  • http://mi.mathnet.ru/eng/al/v58/i4/p528

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. Z. K. Ivanova, M. Kh. Faizrahmanov, “Weak reducibility of computable and generalized computable numberings”, Sib. elektron. matem. izv., 18:1 (2021), 112–120  mathnet  crossref
  • Алгебра и логика Algebra and Logic
    Number of views:
    This page:118
    References:4
    First page:6

     
    Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2022