Doklady Akademii Nauk SSSR
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Dokl. Akad. Nauk:
Year:
Volume:
Issue:
Page:
Find




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

Doklady Akademii Nauk SSSR, 1970, Volume 194, Number 3, Pages 500–503 (Mi dan35679)  
MATHEMATICS

Complexity of the decidability of an enumerable set as a criterion of its universality

M. I. Kanovich

Lomonosov Moscow State University
Full-text PDF (677 kB)
Presented: A. A. Dorodnitsyn
Received: 04.03.1970
Bibliographic databases:
Document Type: Article
UDC: 517.11
Language: Russian
Citation: M. I. Kanovich, “Complexity of the decidability of an enumerable set as a criterion of its universality”, Dokl. Akad. Nauk SSSR, 194:3 (1970), 500–503
Citation in format AMSBIB
\Bibitem{Kan70}
\by M.~I.~Kanovich
\paper Complexity of the decidability of an enumerable set as a criterion of its universality
\jour Dokl. Akad. Nauk SSSR
\yr 1970
\vol 194
\issue 3
\pages 500--503
\mathnet{http://mi.mathnet.ru/dan35679}
\mathscinet{https://mathscinet.ams.org/mathscinet-getitem?mr=0276083}
\zmath{https://zbmath.org/?q=an:0299.02045}
Linking options:
  • https://www.mathnet.ru/eng/dan35679
  • https://www.mathnet.ru/eng/dan/v194/i3/p500
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Statistics & downloads:
    Abstract page:171
    Full-text PDF :79
    References:5
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025