RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Forthcoming papers
Archive
Impact factor
Subscription
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


Mat. Zametki, 1997, Volume 62, Issue 3, Pages 425–429 (Mi mz1624)  

This article is cited in 2 scientific papers (total in 2 papers)

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

R. Sh. Omanadze

Tbilisi Ivane Javakhishvili State University, Ilia Vekua Institute of Applied Mathematics

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.

DOI: https://doi.org/10.4213/mzm1624

Full text: PDF file (154 kB)
References: PDF file   HTML file

English version:
Mathematical Notes, 1997, 62:3, 356–359

Bibliographic databases:

UDC: 510
Received: 15.11.1995
Revised: 24.10.1996

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/mz1624}
\crossref{https://doi.org/10.4213/mzm1624}
\mathscinet{http://www.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{http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&DestLinkType=FullRecord&DestApp=ALL_WOS&KeyUT=000072500900011}


Linking options:
  • http://mi.mathnet.ru/eng/mz1624
  • https://doi.org/10.4213/mzm1624
  • http://mi.mathnet.ru/eng/mz/v62/i3/p425

    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. Omanadze, RS, “Complexity properties of recursively enumerable sets and bsQ-completeness”, Mathematical Notes, 68:3–4 (2000), 476  mathnet  crossref  mathscinet  zmath  isi
    2. Omanadze, RS, “Splittings of effectively speedable sets and effectively levelable sets”, Journal of Symbolic Logic, 69:1 (2004), 143  crossref  mathscinet  zmath  isi  scopus  scopus
  • Математические заметки Mathematical Notes
    Number of views:
    This page:187
    Full text:90
    References:16
    First page:1

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020