Diskretnyi Analiz i Issledovanie Operatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find




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

Diskretnyi Analiz i Issledovanie Operatsii, 2013, Volume 20, Issue 2, Pages 88–101 (Mi da728)  
This article is cited in 1 scientific paper (total in 1 paper)

On maximal and minimal elements in partially ordered sets of Boolean degrees

S. S. Marchenkov

Lomonosov Moscow State University, Moscow, Russia
Full-text PDF (272 kB) Citations (1)
References:
PDF
HTML
Abstract: The weakest variant of algorithmic reducibility called Boolean reducibility is considered. For various closed classes $Q$, the partially ordered sets $\mathcal L_Q$ of Boolean degrees are analyzed. It is proved that for many closed classes $Q$ the corresponding sets $\mathcal L_Q$ have no maximal elements. Examples of sufficiently large classes $Q$ are given for which the sets $\mathcal L_Q$ contain uncountably many maximal elements. It is established that for closed classes $T_{01}$ and $S$M the corresponding sets of degrees have uncountably many minimal elements. Bibliogr. 8.
Keywords: Boolean reducibility, closed classes of Boolean functions.
Received: 29.05.2012
English version:
Journal of Applied and Industrial Mathematics, 2013, Volume 7, Issue 4, Pages 549–556
DOI: https://doi.org/10.1134/S1990478913040091
Bibliographic databases:
Document Type: Article
UDC: 519.71
Language: Russian
Citation: S. S. Marchenkov, “On maximal and minimal elements in partially ordered sets of Boolean degrees”, Diskretn. Anal. Issled. Oper., 20:2 (2013), 88–101; J. Appl. Industr. Math., 7:4 (2013), 549–556
Citation in format AMSBIB
\Bibitem{Mar13}
\by S.~S.~Marchenkov
\paper On maximal and minimal elements in partially ordered sets of Boolean degrees
\jour Diskretn. Anal. Issled. Oper.
\yr 2013
\vol 20
\issue 2
\pages 88--101
\mathnet{http://mi.mathnet.ru/da728}
\mathscinet{https://mathscinet.ams.org/mathscinet-getitem?mr=3113403}
\transl
\jour J. Appl. Industr. Math.
\yr 2013
\vol 7
\issue 4
\pages 549--556
\crossref{https://doi.org/10.1134/S1990478913040091}
Linking options:
  • https://www.mathnet.ru/eng/da728
  • https://www.mathnet.ru/eng/da/v20/i2/p88
    • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретный анализ и исследование операций
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025