|
|
Problemy Peredachi Informatsii, 2010, Volume 46, Issue 4, Pages 83–90
(Mi ppi2027)
|
|
|
|
This article is cited in 2 scientific papers (total in 2 papers)
Large Systems
Complete and incomplete Boolean degrees
S. S. Marchenkov M. V. Lomonosov Moscow State University, Faculty of Computational Mathematics and Cybernetics
Abstract:
We study the partially ordered set of Boolean $P_2$-degrees. We introduce the notions of complete and incomplete Boolean degrees. We show that for each complete $P_2$-degree there exist both a countable decreasing chain of $P_2$-degrees and a countable antichain of $P_2$-degrees. We prove that above each incomplete $P_2$-degree there is a continuum of $P_2$-degrees. Thus, in total we show that in the partially ordered set of $P_2$-degrees there are no maximal elements.
Received: 24.05.2010 Revised: 13.09.2010
Citation:
S. S. Marchenkov, “Complete and incomplete Boolean degrees”, Probl. Peredachi Inf., 46:4 (2010), 83–90; Problems Inform. Transmission, 46:4 (2010), 346–352
Linking options:
https://www.mathnet.ru/eng/ppi2027 https://www.mathnet.ru/eng/ppi/v46/i4/p83
|
|