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, 1992, Volume 52, Issue 3, Pages 102–107 (Mi mz4705)  

This article is cited in 1 scientific paper (total in 1 paper)

On $sQ$-completeness of recursively enumerable sets

R. Sh. Omanadze

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

Abstract: The concepts of $sQ$-reducibility and $sQ_1$-reducibility are considered, and it is shown that these concepts coincide on the class of recursively enumerable sets. Moreover, a description of $sQ$-complete recursively enumerable sets is presented.

Full text: PDF file (729 kB)

English version:
Mathematical Notes, 1992, 52:3, 948–952

Bibliographic databases:

UDC: 510.5
Received: 10.06.1991

Citation: R. Sh. Omanadze, “On $sQ$-completeness of recursively enumerable sets”, Mat. Zametki, 52:3 (1992), 102–107; Math. Notes, 52:3 (1992), 948–952

Citation in format AMSBIB
\Bibitem{Oma92}
\by R.~Sh.~Omanadze
\paper On $sQ$-completeness of recursively enumerable sets
\jour Mat. Zametki
\yr 1992
\vol 52
\issue 3
\pages 102--107
\mathnet{http://mi.mathnet.ru/mz4705}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=1194133}
\zmath{https://zbmath.org/?q=an:0787.03031}
\transl
\jour Math. Notes
\yr 1992
\vol 52
\issue 3
\pages 948--952
\crossref{https://doi.org/10.1007/BF01209615}
\isi{http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&DestLinkType=FullRecord&DestApp=ALL_WOS&KeyUT=A1992LF91500011}


Linking options:
  • http://mi.mathnet.ru/eng/mz4705
  • http://mi.mathnet.ru/eng/mz/v52/i3/p102

    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, “Splittings of effectively speedable sets and effectively levelable sets”, Journal of Symbolic Logic, 69:1 (2004), 143  crossref  mathscinet  zmath  isi
  • Математические заметки Mathematical Notes
    Number of views:
    This page:120
    Full text:54
    First page:1

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