Journal of Applied and Industrial Mathematics

, Volume 1, Issue 4, pp 481–488 | Cite as

A criterion for positive completeness in ternary logic

Article

Abstract

The operator of positive closure is considered on the set P k of functions of k-valued logic. Some positive complete systems of functions are defined. It is proved that every positive complete class of functions from P k is positive generated by the set of all functions depending on at most k variables. For each k ⩾ 3, the three families of positive precomplete classes are defined. It is shown that, for k = 3, the 10 classes of these families constitute a criterion system.

Keywords

Boolean Function Constant Function Distinct Element Closure Operator Criterion System 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    A. F. Danil’chenko, “Parametric Expressibility of Functions of Three-Valued Logic,” Algebra Logika 16(4), 197–216 (1977) [Algebra Logic 16, 266–280 (1978)].MathSciNetGoogle Scholar
  2. 2.
    A. V. Kuznetsov, “Means for Detection of Nondeducibility and Inexpressibility,” in Logical Inference (Nauka, Moscow, 1979), pp. 5–33.Google Scholar
  3. 3.
    S. S. Marchenkov, Closed Classes of Boolean Functions (Fizmatlit, Moscow, 2000) [in Russian].MATHGoogle Scholar
  4. 4.
    S. S. Marchenkov, “Equational Closure,” Diskret. Mat. 17(2), 117–126 (2005) [Discrete Math. Appl. 15(3), 289–298 (2005)].MathSciNetGoogle Scholar
  5. 5.
    S. S. Marchenkov, Functional Systems with Superposition Operation (Fizmatlit, Moscow, 2004) [in Russian].Google Scholar
  6. 6.
    S. S. Marchenkov, “On Expressibility of Functions of Many-Valued Logic in Some Logical-Functional Languages,” Diskret. Mat. 11(4), 110–126 (1999) [Discrete Math. Appl. 9 (6), 563–581 (1999)].Google Scholar
  7. 7.
    E. L. Post, “Introduction to a General Theory of Elementary Propositions,” Amer. J. Math. 43, 163–185 (1921).CrossRefMathSciNetGoogle Scholar
  8. 8.
    E. L. Post, Two-Valued Iterative Systems of Mathematical Logic (Princeton Univ. Press, Princeton, 1941).MATHGoogle Scholar
  9. 9.
    S. V. Yablonskii, Introduction to Discrete Mathematics (Nauka, Moscow, 1986) [in Russian].Google Scholar
  10. 10.
    S. V. Yablonskii, “Functional Constructions in k-valued Logic,” Trudy Mat. Inst. Steklov. 51, 5–142 (1958).MathSciNetGoogle Scholar
  11. 11.
    Yu. I. Yanov and A. A. Muchnik, “On the Existence of k-Valued Closed Classes Without a Finite Basis,” Dokl. Akad. Nauk SSSR 127, 44–46 (1959).MATHMathSciNetGoogle Scholar

Copyright information

© Pleiades Publishing, Ltd. 2007

Authors and Affiliations

  1. 1.Department of Mathematical CyberneticsMoscow State UniversityVorob’ovy gory, MoscowRussia

Personalised recommendations