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, 1992, Volume 52, Issue 3, Pages 102–107 (Mi mzm4705)  
This article is cited in 3 scientific papers (total in 3 papers)

On sQ-completeness of recursively enumerable sets

R. Sh. Omanadze

Tbilisi Ivane Javakhishvili State University, Ilia Vekua Institute of Applied Mathematics
Full-text PDF (729 kB) Citations (3)
Abstract: The concepts of sQ-reducibility and sQ1-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.
Received: 10.06.1991
English version:
Mathematical Notes, 1992, Volume 52, Issue 3, Pages 948–952
DOI: https://doi.org/10.1007/BF01209615
Bibliographic databases:
UDC: 510.5
Language: Russian
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/mzm4705}
\mathscinet{http://mathscinet.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{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=A1992LF91500011}
Linking options:
  • https://www.mathnet.ru/eng/mzm4705
  • https://www.mathnet.ru/eng/mzm/v52/i3/p102
    • This publication is cited in the following 3 articles:
    1. Roland Omanadze, Irakli Chitaia, “Non-empty open intervals of computably enumerable sQ1-degrees”, Logic Journal of the IGPL, 2024  crossref
    2. Roland Sh. Omanadze, “sQ1-degrees of computably enumerable sets”, Arch. Math. Logic, 62:3-4 (2023), 401  crossref
    3. Omanadze, RS, “Splittings of effectively speedable sets and effectively levelable sets”, Journal of Symbolic Logic, 69:1 (2004), 143  crossref  mathscinet  zmath  isi
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Математические заметки Mathematical Notes
    Statistics & downloads:
    Abstract page:205
    Full-text PDF :88
    First page:1
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025