Sibirskii Matematicheskii Zhurnal
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


Sibirsk. Mat. Zh.:
Year:
Volume:
Issue:
Page:
Find




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

Sibirskii Matematicheskii Zhurnal, 2017, Volume 58, Number 3, Pages 710–716
DOI: https://doi.org/10.17377/smzh.2017.58.318 (Mi smj2891) 		 
This article is cited in 13 scientific papers (total in 13 papers)

Minimal generalized computable enumerations and high degrees

M. Kh. Faizrahmanov

Kazan (Volga Region) Federal University, Kazan, Russia
Full-text PDF (287 kB) Citations (13)
References:
PDF
HTML
DOI: https://doi.org/10.17377/smzh.2017.58.318
Abstract: We establish that the set of minimal generalized computable enumerations of every infinite family computable with respect to a high oracle is effectively infinite. We find some sufficient condition for enumerations of the infinite families computable with respect to high oracles under which there exist minimal generalized computable enumerations that are irreducible to the enumerations.
Keywords: generalized computable enumeration, minimal enumeration, high set, Low$_2$ set, arithmetic enumeration.
Funding agency Grant number
Ministry of Education and Science of the Russian Federation 1.1515.2017/ПЧ
Russian Foundation for Basic Research 15-01-08252
The author was supported by the subsidy of the government task for Kazan (Volga Region) Federal University (Grant 1.1515.2017/PP) and the Russian Foundation for Basic Research (Grant 15-01-08252).
Received: 03.03.2016
Revised: 13.12.2016
English version:
Siberian Mathematical Journal, 2017, Volume 58, Issue 3, Pages 553–558
DOI: https://doi.org/10.1134/S0037446617030181
Bibliographic databases:
Document Type: Article
UDC: 510.54+510.57
MSC: 35R30
Language: Russian
Citation: M. Kh. Faizrahmanov, “Minimal generalized computable enumerations and high degrees”, Sibirsk. Mat. Zh., 58:3 (2017), 710–716; Siberian Math. J., 58:3 (2017), 553–558
Citation in format AMSBIB
\Bibitem{Fai17}
\by M.~Kh.~Faizrahmanov
\paper Minimal generalized computable enumerations and high degrees
\jour Sibirsk. Mat. Zh.
\yr 2017
\vol 58
\issue 3
\pages 710--716
\mathnet{http://mi.mathnet.ru/smj2891}
\crossref{https://doi.org/10.17377/smzh.2017.58.318}
\elib{https://elibrary.ru/item.asp?id=29160460}
\transl
\jour Siberian Math. J.
\yr 2017
\vol 58
\issue 3
\pages 553--558
\crossref{https://doi.org/10.1134/S0037446617030181}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000404212100018}
\elib{https://elibrary.ru/item.asp?id=31027438}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85021269219}
Linking options:
  • https://www.mathnet.ru/eng/smj2891
  • https://www.mathnet.ru/eng/smj/v58/i3/p710
    • This publication is cited in the following 13 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Сибирский математический журнал Siberian Mathematical Journal
    Statistics & downloads:
    Abstract page:194
    Full-text PDF :45
    References:41
    First page:4
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024