Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

Realization of Boolean functions by repetition-free formulas in a particular base

  • 23 Accesses

  • 1 Citations

Abstract

Under study are the representations of Boolean functions by formulas. We offer a criterion for the Boolean functions to be repetition-free in the base {V,·, −0, 1, x 1(x 2 V x 3 x 4) V x 5(x 3 V x 2 x 4)}.

This is a preview of subscription content, log in to check access.

References

  1. 1.

    Cherukhin D. Yu., “An algorithmic criterion for the comparison of Boolean bases,” Mat. Voprosy Kibernet., No. 8, 77–122 (1999).

  2. 2.

    Subbotovskaya B. A., “Comparison of bases in the realization by formulas of functions of the algebra of logic,” Soviet Math. Dokl., 149, No. 4, 478–481 (1963).

  3. 3.

    Stetsenko V. A., “On the premaximal bases in P2,” Mat. Voprosy Kibernet., No. 4, 139–177 (1992).

  4. 4.

    Cherukhin D. Yu., “On the premaximal Boolean bases,” Discrete Math. Appl., 9, No. 3, 295–342 (1999).

  5. 5.

    Gurvich V. A., “Repetition-free criteria of functions in the algebra of logic,” Soviet Math. Dokl., 43, No. 3, 721–726 (1991).

  6. 6.

    Kirichenko K. D., “Repetition-free criteria for Boolean functions in various bases,” in: Optimization, Control, and Intellect [in Russian], Irkutsk, 2000, No. 4, pp. 93–101.

  7. 7.

    Peryazev N. A., “Realization of Boolean functions by the repetition-free formulas in some bases,” in: Algebra, Logic, and Applications [in Russian], Irkutsk, 1994, pp. 143–154.

  8. 8.

    Peryazev N. A., “On realization of Boolean functions by formulae without repetitions,” Discrete Math. Appl., 5, No. 4, 347–355 (1995).

  9. 9.

    Peryazev N. A. and Sharankhaev I. K., “Repetition-free criteria for a Boolean function in the pre-elementary bases of rank 3,” Discrete Math. Appl., 15, No. 3, 299–311 (2005).

  10. 10.

    Peryazev N. A., Fundamentals of the Theory of Boolean Functions [in Russian], Fizmatlit, Moscow (1999).

  11. 11.

    Sharankhaev I. K., “On weak-repetition Boolean functions in some pre-elementary basis,” Diskret. Anal. Issled. Oper. Ser. 1, 10, No. 2, 79–101 (2003).

Download references

Author information

Correspondence to I. K. Sharankhaev.

Additional information

Original Russian Text Copyright © 2009 Sharankhaev I. K.

__________

Translated from Sibirskiĭ Matematicheskiĭ Zhurnal, Vol. 50, No. 1, pp. 231–237, January–February, 2009.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Sharankhaev, I.K. Realization of Boolean functions by repetition-free formulas in a particular base. Sib Math J 50, 188–192 (2009). https://doi.org/10.1007/s11202-009-0021-8

Download citation

Keywords

  • Boolean function
  • formula
  • base
  • repetition-free function
  • weak-repetition function
  • almost elementary base