Modelirovanie i Analiz Informatsionnykh Sistem
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

Modelirovanie i Analiz Informatsionnykh Sistem, 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
Full-text PDF (242 kB)
References:
PDF
HTML
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.
Received: 26.11.2009
Document Type: Article
UDC: 517. 977
Language: Russian
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:
  • https://www.mathnet.ru/eng/mais13
  • https://www.mathnet.ru/eng/mais/v17/i1/p44
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Моделирование и анализ информационных систем
    Statistics & downloads:
    Abstract page:180
    Full-text PDF :78
    References:50
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024