RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Model. Anal. Inform. Sist.:
Year:
Volume:
Issue:
Page:
Find






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


Model. Anal. Inform. Sist., 2010, Volume 17, Number 1, Pages 44–51 (Mi mais13)  

Properties of weak pm-reducibility of sets

K. V. Petrova

Ivanovo State University of Chemistry and Technology

Abstract: A new reducibility (the so-called apm-reducibility) of enumeration type, which is weaker than the pm-reducibility is introduced in this paper. Some important properties of this new reducibility are proved here.

Keywords: computability, enumeration reducibility, enumeration degrees, almost partial m-reducibility

Full text: PDF file (242 kB)
References: PDF file   HTML file
UDC: 517. 977
Received: 26.11.2009

Citation: K. V. Petrova, “Properties of weak pm-reducibility of sets”, Model. Anal. Inform. Sist., 17:1 (2010), 44–51

Citation in format AMSBIB
\Bibitem{Pet10}
\by K.~V.~Petrova
\paper Properties of weak pm-reducibility of sets
\jour Model. Anal. Inform. Sist.
\yr 2010
\vol 17
\issue 1
\pages 44--51
\mathnet{http://mi.mathnet.ru/mais13}


Linking options:
  • http://mi.mathnet.ru/eng/mais13
  • http://mi.mathnet.ru/eng/mais/v17/i1/p44

    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
  • Моделирование и анализ информационных систем
    Number of views:
    This page:105
    Full text:52
    References:32

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