Skip to main content
SpringerLink
Log in

Complexity of functions from some classes of three-valued logic

  • Brief Communications
  • Published:
Moscow University Mathematics Bulletin Aims and scope

Abstract

The problem of the realization complexity for functions of the three-valued logic taking values from the set {0, 1} by formulas over incomplete generating systems is considered. Upper and lower asymptotic estimates for the corresponding Shannon functions are obtained.

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

References

  1. D. A. Dagaev, “The Complexity of Pseudo-Linear Functions” Vestn. Mosk. Univ., Matem. Mekhan., No. 2, 53 (2010).

  2. O. B. Lupanov, Asymptotic Estimates for Complexity of Control Systems (Moscow State Univ., Moscow, 1984) [in Russian].

    Google Scholar 

  3. O. B. Lupanov, “On Synthesis of Some Classes of Control Systems,” Probl. Kibernet. 10, 63 (1963).

    MathSciNet  Google Scholar 

  4. O. B. Lupanov, “Complexity of Formula Realization of Functions of Logical Algebra,” Probl. Kibernet. 3, 61 (1960).

    MathSciNet  Google Scholar 

  5. S. V. Yablonskii, Introduction to Discrete Mathematics (Vysshaya Shkola, Moscow, 2008) [in Russian].

    Google Scholar 

  6. D. Lau, Function Algebras on Finite Sets (Springer-Verlag, Berlin, 2006).

    MATH  Google Scholar 

  7. A. B. Ugol’nikov, “Depth and Complexity of Formulas Realizing Functions from Closed Classes,” Doklady Akad. Nauk SSSR 298(6), 1341 (1988).

    MathSciNet  Google Scholar 

  8. S. B. Gashkov, “Parallel Computation of Some Classes of Polynomials with Increasing Number of Variables,” Vestn. Mosk. Univ., Matem. Mekhan., No. 2, 88 (1990).

  9. E. Yu. Zakharova, “Realization of Functions from P k by Formulas,” Matem. Zametki 11(1), 99 (1972).

    Google Scholar 

  10. S. A. Lozhkin, “Complexity of Realization for Functions of k-Valued Logic by Formulas and Quasi-Formulas,” in Proc. XI Intern. Conf. “Problems in Theoretical Cybernetics”, Ul’yanovsk, June 10–14, 1996 (Izd-vo RGGU, Moscow, 1996) [in Russian], pp. 125–127.

    Google Scholar 

  11. A. B. Ugol’nikov, “Complexity of Realization for a Certain Sequence of Functions of 4-Valued Logic by Formulas,” Vestn. Mosk. Univ., Matem. Mekhan. No. 3, 52 (2004).

  12. A. B. Ugol’nikov, “On Closed Post Classes,” Izv. Vuzov, Matem., No. 7, 79 (1988).

  13. Yu. L. Vasil’ev and V. V. Glagolev, “Metric Properties of Disjunctive Normal Forms,” in Discrete Mathematics and Mathematical Problems in Cybernetics (Nauka, Moscow, 1974), Vol. 1, pp. 99–148.

    Google Scholar 

  14. A. B. Ugol’nikov, “Synthesis of Schemes and Formulas in Incomplete Bases,” Doklady Akad. Nauk SSSR 249(1), 60 (1979).

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Mechanics and Mathematics, Moscow State University, Leninskie Gory, Moscow, 119899, Russia

    D. A. Dagaev

Authors
  1. D. A. Dagaev
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Original Russian Text © D.A. Dagaev, 2011, published in Vestnik Moskovskogo Universiteta, Matematika. Mekhanika, 2011, Vol. 66, No. 3, pp. 60–63.

About this article

Cite this article

Dagaev, D.A. Complexity of functions from some classes of three-valued logic. Moscow Univ. Math. Bull. 66, 133–135 (2011). https://doi.org/10.3103/S0027132211030119

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S0027132211030119

Keywords

Search

Navigation