Abstract
The paper addresses the “weakest” algorithmic reducibility—Boolean reducibility. Under study are the partially ordered sets of Boolean degrees L Q corresponding to the various closed classes of Boolean functions Q. The set L Q is shown to have no maximal elements for many closed classes Q. Some examples are given of a sufficiently large classes Q for which L Q contains continuum many maximal elements. It is found that the sets of degrees corresponding to the closed classes T 01 and SM contain continuum many minimal elements.
Similar content being viewed by others
References
S. S. Marchenkov, Closed Classes of Boolean Functions (Fizmatlit, Moscow, 2000) [in Russian].
S. S. Marchenkov, “Boolean Reducibility,” Diskretn. Mat. 15(3), 40–53 (2003).
S. S. Marchenkov, “Finite Generability of Closed Classes of Boolean Functions,” Diskretn. Anal. Issled.Oper. Ser. 1, 12(1), 101–118 (2005).
S. S. Marchenkov, “On the Structure of Partially Ordered Sets of Boolean Degrees,” Diskretn. Mat. 18(1), 63–75 (2006).
S. S. Marchenkov, “Complete and Incomplete Boolean Degrees,” Problemy Peredachi Inform. 46(4), 83–90 (2010) [Problems Inform. Transmission 46 (4), 346–352 (2010)].
S. S. Marchenkov and S. A. Matveev, “Boolean Degrees Defined by the Classes of Linear Functions and Conjunctions,” Mat. Voprosy Kibernet. 14, 35–48 (2005).
G. Reina, “Degrees of Automatic Transforms,” Kibernet. Sb. 14, 95–106 (1977).
H. Rogers, Theory of Recursive Functions and Effective Computability (The MIT Press, Cambridge, Massachusetts, 1967; Mir, Moscow, 1972).
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © S.S. Marchenkov, 2013, published in Diskretnyi Analiz i Issledovanie Operatsii, 2013, Vol. 20, No. 2, pp. 88–101.
Rights and permissions
About this article
Cite this article
Marchenkov, S.S. On maximal and minimal elements of partially ordered sets of Boolean degrees. J. Appl. Ind. Math. 7, 549–556 (2013). https://doi.org/10.1134/S1990478913040091
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S1990478913040091