Skip to main content
SpringerLink
Log in

Implicitly Maximal Classes and Implicit Completeness Criterion in the Three-Valued Logic

  • Published:
Moscow University Mathematics Bulletin Aims and scope

Abstract

The problem of implicit expressibility in the three-valued logic is considered. The system of all implicitly maximal classes is described. The corresponding criterion of implicit completeness is formulated.

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. A. V. Kuznetsov, “The Facilities to Detect Non-Deducibility and Non-Expressibility,” in Logical Deduction, ed. by V. A. Smirnov (Nauka, Moscow, 1979), pp. 5–33.

    Google Scholar 

  2. P. M. Cohn, Universal Algebra (Harper & Row, N.Y., 1965; Mir, Moscow, 1968).

    MATH  Google Scholar 

  3. O. M. Kasim-Zade, “On Implicit Expressibility of Boolean Functions,” Vestn. Mosk. Univ., Matem. Mekhan., No. 2, 44 (1995) [Moscow Univ. Math. Bull. 50 (2), 42 (1995)].

    MathSciNet  MATH  Google Scholar 

  4. O. M. Kasim-Zade, “Implicit Expressibility in Two-Valued Logic and Crypto-Isomorphisms of Two-Element Algebras,” Doklady Russ. Akad. Nauk 348 (3), 299 (1996) [Doklady Math. 53 (3), 366 (1996)].

    MathSciNet  MATH  Google Scholar 

  5. O. M. Kasim-Zade, “On a Metric Characteristic of Implicit and Parametric Representations of Boolean Functions,” in Mathematical Problems of Cybernetics, ed. by S. V. Yablonskii (Fizmatlit, Moscow, 1996), Vol. 6, pp. 133–188.

    MathSciNet  MATH  Google Scholar 

  6. O. M. Kasim-Zade, “Implicit Completeness in the fc-valued Logic,” Vestn. Mosk. Univ., Matem. Mekhan., No. 3, 9 (2007) [Moscow Univ. Math. Bull. 62 (3), 90 (2007)].

    MATH  Google Scholar 

  7. S. V. Yablonskii, “Functional Constructions in the fc-Valued Logic,” in Collection of Articles in Mathematical Logic and its Applications to Some Problems of Cybernetics, Trudy Steklov. Matem. Inst. RAS 51, 5 (1958).

    Google Scholar 

  8. S. V. Yablonskii and O. B. Lupanov, Discrete Mathematics and Mathematical Problems of Cybernetics, Vol. 1 (Nauka, Moscow, 1974; Birkhäuser, 1980).

  9. O. M. Kasim-Zade, “The Complexity of the Parametric Representations of Boolean Functions,” in: Mathematical Problems of Cybernetics, ed. by S. V. Yablonskii (Fizmatlit, Moscow, 1998), Vol. 7, pp. 85–160.

    MathSciNet  MATH  Google Scholar 

  10. E. A. Orekhova, “On an Implicit Completeness Criterion in Tree-Valued Logic,” in: Mathematical Problems of Cybernetics, ed. by O. B. Lupanov (Fizmatlit, Moscow, 2003), Vol. 12, pp. 27–74.

    Google Scholar 

  11. E. A. Orekhova, “A Criterion for the Implicit Sheffer Property in Three-Valued Logic,” Diskretn. Anal. Issled. Oper. 10 (3), 82 (2003).

    MathSciNet  MATH  Google Scholar 

  12. A. F. Danilchrnko, “The Parametric Expressibility of Functions of Three-Valued Logic,” Algebra i Logika 16 (4), 397 (1977).

    MathSciNet  Google Scholar 

  13. E. A. Orekhova, “A Criterion of Implicit Completeness in fc-Valued Logic,” in: Mathematical Problems of Cybernetics, ed. by S. V. Yablonskii (Fizmatlit, Moscow, 2002), Vol. 11, pp. 77–90.

    MathSciNet  MATH  Google Scholar 

  14. G. A. Brule, “The class of k-Valued Function Containing of One Variable,” Diskret, Anal, No. 10, 3 (1967).

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    M. V. Starostin

Authors
  1. M. V. Starostin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to M. V. Starostin.

Additional information

Original Russian Text © M.V. Starostin. 2018. published in Vestnik Moskouskogo Uniuersiteta. Matematika. Mekhanika. 2018. Vol. 73, No. 2, pp. 56–59.

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Starostin, M.V. Implicitly Maximal Classes and Implicit Completeness Criterion in the Three-Valued Logic. Moscow Univ. Math. Bull. 73, 82–84 (2018). https://doi.org/10.3103/S0027132218020067

Download citation

  • Received:

  • Published:

  • Issue Date:

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

Search

Navigation