Skip to main content
Log in

Depth of functions of the k-valued logic in infinite bases

  • Published:
Moscow University Mathematics Bulletin Aims and scope

Abstract

The realization of functions of the k-valued logic by circuits is considered over an arbitrary infinite complete basis B. The Shannon function D B (n) of the circuit depth over B is examined (for any positive integer n the value D B (n) is the minimal depth sufficient to realize every function of the k-valued logic of n variables by a circuit over B). It is shown that for each fixed k ≥ 2 and for any infinite complete basis B either there exists a constant α ≥ 1 such that D B (n) = α for all sufficiently large n, or there exist constants β (β > 0), γ, δ such that βlog2 nD B (n) ≤ γlog2 n + δ for all n.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. O. B. Lupanov, “Circuits of Functional Elements with Delay,” in Problemy Kibernetiki (Nauka, Moscow, 1970), Vol. 23, pp. 43–81.

    Google Scholar 

  2. J. E. Savage, The Complexity of Computing (Wiley, New York, 1976; Faktorial, Moscow, 1998).

    MATH  Google Scholar 

  3. O. M. Kasim-Zade, “The Depth of Boolean Functions Realized by Circuits over an Arbitrary Basis,” Vestn. Mosk. Univ., Matem. Mekhan. No. 1, 18 (2007) [Moscow Univ. Math. Bulletin 62 (1), 18 (2007)].

  4. O. M. Kasim-Zade, “The Depth of Boolean Functions over an Arbitrary Infinite Basis,” Diskretn. Anal. Issled. Operatsii 14(1), 45 (2007).

    MathSciNet  Google Scholar 

  5. R. Smolensky, “Algebraic Methods in the Theory of Lower Bounds for Boolean Circuit Complexity,” in Proc. 19th Annual ACM Symposium on Theory of Computing (1987) (ACM, N.Y., 1987), pp. 77–82.

    Google Scholar 

  6. E. Post, “Introduction to a General Theory of Elementary Propositions,” Amer. J. Math. 43, 163 (1921).

    Article  MATH  MathSciNet  Google Scholar 

  7. S. V. Yablonskii, “Introduction to the Theory of Functions of the k-Valued Logic,” in Discrete Mathematics and Mathematical Problems of Cybernetics, Ed. by S. V. Yablonskii and O. B. Lupanov (Nauka, Moscow, 1974), Vol. I, pp. 9–66.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Original Russian Text © A.V. Kochergin, 2011, published in Vestnik Moskovskogo Universiteta, Matematika. Mekhanika, 2011, Vol. 66, No. 1, pp. 22–26.

About this article

Cite this article

Kochergin, A.V. Depth of functions of the k-valued logic in infinite bases. Moscow Univ. Math. Bull. 66, 20–24 (2011). https://doi.org/10.3103/S0027132211010049

Download citation

  • Received:

  • Published:

  • Issue Date:

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

Keywords

Navigation