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, 2024, Volume 65, Number 2, Pages 395–407
DOI: https://doi.org/10.33048/smzh.2024.65.212
(Mi smj7862)
 

A family with a single minimal but not least numbering

M. Kh. Faizrahmanov

Kazan (Volga Region) Federal University
References:
Abstract: We prove the existence of a family of computably enumerable sets that, up to equivalence, has a unique computable minimal but not least numbering.
Keywords: minimal numbering, computable numbering, computable family, discrete family.
Received: 27.04.2023
Revised: 01.10.2023
Accepted: 28.01.2024
Document Type: Article
UDC: 510.5
MSC: 35R30
Language: Russian
Citation: M. Kh. Faizrahmanov, “A family with a single minimal but not least numbering”, Sibirsk. Mat. Zh., 65:2 (2024), 395–407
Citation in format AMSBIB
\Bibitem{Fai24}
\by M.~Kh.~Faizrahmanov
\paper A~family with~a~single minimal but not least numbering
\jour Sibirsk. Mat. Zh.
\yr 2024
\vol 65
\issue 2
\pages 395--407
\mathnet{http://mi.mathnet.ru/smj7862}
\crossref{https://doi.org/10.33048/smzh.2024.65.212}
Linking options:
  • https://www.mathnet.ru/eng/smj7862
  • https://www.mathnet.ru/eng/smj/v65/i2/p395
  • 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:60
    Full-text PDF :1
    References:18
    First page:15
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024