Skip to main content
SpringerLink
Log in

Binary functions of multivalued arguments: generalization and investigation of disjunctive normal forms for such functions

  • Published:
Computational Mathematics and Mathematical Physics Aims and scope Submit manuscript

Abstract

The theory of disjunctive normal forms is generalized to binary functions of multivalued arguments. Fundamental concepts and properties of these generalizations are considered. An efficient method for constructing disjunctive normal forms for binary functions of multivalued arguments with a small number of zeros is proposed. Disjunctive normal forms of an analogue of the Yablonsky function are studied in detail.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Discrete Mathematics and Mathematical Problems of Cybernetics, Ed. by S. V. Yablonsky and O. B. Lupanov (Nauka, Moscow, 1974), Vol. 1.

    Google Scholar 

  2. I. Platonenko, Implementation of Kora-type algorithms by systems of special Boolean equations (Vychisl. Tsentr Akad. Nauk SSSR, Moscow, 1983) [in Russian].

    Google Scholar 

  3. L. V. Baskakova and Yu. I. Zhuravlev, “A model of recognition algorithms with representative samples and systems of supporting sets,” USSR Comput. Math. Math. Phys. 21(5), 189–199 (1981).

    Article  MATH  MathSciNet  Google Scholar 

  4. U. A. Abdugaliev, “On normal forms of k-valued logic,” Kibernetika, No. 1, 16–20 (1967).

    Google Scholar 

  5. A. N. Nurlybaev, “On normal forms of k-valued logic,” in Collected Papers on Mathematical Cybernetics (Vychisl. Tsentr Akad. Nauk SSSR, Moscow, 1976), No. 1, pp. 56–68 [in Russian].

    Google Scholar 

  6. Yu. I. Zhuravlev and A. Yu. Kogan, “Realization of Boolean functions with a small number of zeros by disjunctive normal forms, and related problems,” Sov. Math. Dokl. 32, 771–775 (1985).

    MATH  Google Scholar 

  7. Yu. I. Zhuravlev and A. Yu. Kogan, “An algorithm for constructing a disjunctive normal form equivalent to the product of the left-hand sides of Nelson Boolean equations,” USSR Comput. Math. Math. Phys. 26(4), 184–188 (1986).

    Article  MATH  MathSciNet  Google Scholar 

  8. A. Yu. Kogan, “Disjunctive normal forms of Boolean functions with a small number of zeros,” USSR Comput. Math. Math. Phys. 27(3), 185–190 (1987).

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Computational Mathematics and Cybernetics, Moscow State University, Moscow, 119991, Russia

    A. V. Panov

Authors
  1. A. V. Panov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to A. V. Panov.

Additional information

Original Russian Text © A.V. Panov, 2015, published in Zhurnal Vychislitel’noi Matematiki i Matematicheskoi Fiziki, 2015, Vol. 55, No. 1, pp. 135–144.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Panov, A.V. Binary functions of multivalued arguments: generalization and investigation of disjunctive normal forms for such functions. Comput. Math. and Math. Phys. 55, 131–139 (2015). https://doi.org/10.1134/S0965542515010194

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0965542515010194

Keywords

Search

Navigation