Skip to main content
SpringerLink
Log in

Read-Once Functions of the Algebra of Logic in Pre-Elementary Bases

  • Published:
Algebra and Logic Aims and scope

Functions of the algebra of logic that can be realized by read-once formulas over finite bases are studied. Necessary and sufficient conditions are derived under which functions of the algebra of logic are read-once in pre-elementary bases {−, ·,∨, 0, 1, x1 · . . . · xn ∨ \( {\overline{x}}_1 \)· . . . · \( {\overline{x}}_n \)} and {−, ·,∨, 0, 1, x1(x2 ∨ x3 · . . . · xn) ∨ x2\( {x}_2{\overline{x}}_3 \) · . . . · \( {\overline{x}}_n \)} where n ≥ 4. This completes the description of classes of read-once functions of the algebra of logic in all pre-elementary bases.

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. B. A. Subbotovskaya, “Comparison of bases for the realization by formulas of functions of an algebra of logic,” Dokl. Akad. Nauk SSSR, 149, No. 4, 784-787 (1963).

    MathSciNet  MATH  Google Scholar 

  2. D. Yu. Cherukhin, “Algorithmic criteria of comparison of Boolean bases,” in Mat. Vopr. Kiber., Iss. 8, 77-122 (1999).

  3. I. K. Sharankhaev, “Realization of Boolean functions by repetition-free formulas in a particular base,” Sib. Math. J., 50, No. 1, 188-192 (2009).

    Article  MathSciNet  MATH  Google Scholar 

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

  5. I. K. Sharankhaev, “On repetition-free Boolean functions over pre-elementary monotone bases,” Diskr. Mat., 21, No. 2, 88-93 (2009).

    Article  MathSciNet  MATH  Google Scholar 

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

  7. K. D. Kirichenko, “Weakly repetition-containing Boolean functions in some pre-elementary base,” in Diskr. Mat. Inform., Iss. 13, Irkutsk University, Irkutsk (2000).

  8. I. K. Sharankhaev, “On classification of bases of Boolean functions,” Vest. Buryat. Univer., Ser. 13, No. 3, 261-67 (2006).

    Google Scholar 

  9. N. A. Peryazev and I. K. Sharankhaev, “Criteria for Boolean functions to be repetition-free in pre-elementary bases of rank 3,” Diskr. Mat., 17, No. 2, 127-138 (2005).

    Article  MathSciNet  MATH  Google Scholar 

  10. I. K. Sharankhaev, “On repetition-free Boolean functions in some bases,” Vest. Buryat. Univer., No. 9, 237-243 (2010).

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Ul. Smolina 24a, Ulan-Ude, 67000, Russia

    I. K. Sharankhaev

Authors
  1. I. K. Sharankhaev
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to I. K. Sharankhaev.

Additional information

Supported by a grant of Buryat State University.

Translated from Algebra i Logika, Vol. 58, No. 2, pp. 271-284, March-April, 2019.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Sharankhaev, I.K. Read-Once Functions of the Algebra of Logic in Pre-Elementary Bases. Algebra Logic 58, 186–195 (2019). https://doi.org/10.1007/s10469-019-09536-0

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10469-019-09536-0

Keywords

Search

Navigation