Closed Classes of Boolean Functions

  • Mikhail MoshkovEmail author
Part of the Intelligent Systems Reference Library book series (ISRL, volume 179)


In this chapter, for decision tables corresponding to functions from an arbitrary closed class of Boolean functions, the depth of deterministic, nondeterministic, and strongly nondeterministic decision trees is studied. The obtained results have some independent interest. Proofs of these results illustrate mainly methods for the proof of lower bounds on complexity of decision trees.


  1. 1.
    Moshkov, M.: About the depth of decision trees computing Boolean functions. Fundam. Inform. 22(3), 203–215 (1995)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Moshkov, M.: Time complexity of decision trees. In: Peters, J.F., Skowron, A. (eds.) Transactions on Rough Sets III, Lecture Notes in Computer Science, vol. 3400, pp. 244–459. Springer, Berlin (2005)Google Scholar
  3. 3.
    Post, E.: Introduction to a general theory of elementary propositions. Am. J. Math. 43, 163–185 (1921)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Post, E.: Two-Valued Iterative Systems of Mathematical Logic. Annals of Mathematics Studies, vol. 5. Princeton University Press, Princeton-London (1941)Google Scholar
  5. 5.
    Yablonskii, S.V., Gavrilov, G.P., Kudriavtzev, V.B.: Functions of the Algebra of Logic and Post Classes. Nauka Publishers, Moscow (1966). (in Russian)Google Scholar

Copyright information

© The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG 2020

Authors and Affiliations

  1. 1.Computer, Electrical and Mathematical Science and Engineering DivisionKing Abdullah University of Science and TechnologyThuwalSaudi Arabia

Personalised recommendations