Matematicheskie Zametki
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Forthcoming papers
Archive
Impact factor
Guidelines for authors
License agreement
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Mat. Zametki:
Year:
Volume:
Issue:
Page:
Find




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

Matematicheskie Zametki, 1997, Volume 62, Issue 3, Pages 425–429
DOI: https://doi.org/10.4213/mzm1624 (Mi mzm1624) 		 
This article is cited in 6 scientific papers (total in 6 papers)

Complexity properties of recursively enumerable sets and $sQ$-completeness

R. Sh. Omanadze

Tbilisi Ivane Javakhishvili State University, Ilia Vekua Institute of Applied Mathematics
Full-text PDF (154 kB) Citations (6)
References:
PDF
HTML
DOI: https://doi.org/10.4213/mzm1624
Abstract: The notions of effectively subcreative set and strongly effectively acceleratable set are introduced. It is proved that the notions of effectively subcreative set, strongly effectively acceleratable set, and $sQ$-complete recursively enumerable set are equivalent.
Received: 15.11.1995
Revised: 24.10.1996
English version:
Mathematical Notes, 1997, Volume 62, Issue 3, Pages 356–359
DOI: https://doi.org/10.1007/BF02360877
Bibliographic databases:
UDC: 510
Language: Russian
Citation: R. Sh. Omanadze, “Complexity properties of recursively enumerable sets and $sQ$-completeness”, Mat. Zametki, 62:3 (1997), 425–429; Math. Notes, 62:3 (1997), 356–359
Citation in format AMSBIB
\Bibitem{Oma97}
\by R.~Sh.~Omanadze
\paper Complexity properties of recursively enumerable sets and $sQ$-completeness
\jour Mat. Zametki
\yr 1997
\vol 62
\issue 3
\pages 425--429
\mathnet{http://mi.mathnet.ru/mzm1624}
\crossref{https://doi.org/10.4213/mzm1624}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1620082}
\zmath{https://zbmath.org/?q=an:0922.03059}
\transl
\jour Math. Notes
\yr 1997
\vol 62
\issue 3
\pages 356--359
\crossref{https://doi.org/10.1007/BF02360877}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000072500900011}
Linking options:
  • https://www.mathnet.ru/eng/mzm1624
  • https://doi.org/10.4213/mzm1624
  • https://www.mathnet.ru/eng/mzm/v62/i3/p425
    • This publication is cited in the following 6 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Математические заметки Mathematical Notes
    Statistics & downloads:
    Abstract page:300
    Full-text PDF :167
    References:33
    First page:1
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024