Skip to main content
SpringerLink
Log in

Some results on the minimal coverings of precomplete classes in partialk-valued logic functions

  • Others
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

In completeness theories of multiple-valued logic, the characterization of Sheffer functions is an important issue. The solution can be reduced to determining the minimal coverings of precomplete classes. In this paper, someFull Symmetric Function Sets (m=3) are proved to be components of the minimal covering of precomplete classes inP * k .

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. Jan Lukasiewicz. On three-valued logic.Ruch Filozoficzny, 1920, (5): 169–171.

    Google Scholar 

  2. Emil Post. Introduction to a general theory of elementary propositions.American Journal of Mathematics, 1921, (43): 163–185.

    Article  MATH  MathSciNet  Google Scholar 

  3. Emil Post. The two-valued iterative systems of mathematical logic.Annals of Math. Studies, 1941, (5): 1–122.

    MathSciNet  Google Scholar 

  4. Jablonskii S V. Functional constructions in ak-valued logic.Trudy Mat. Inst. Steklov, 1985, 51: 5–142. (in Russian)

    MathSciNet  Google Scholar 

  5. Rosenberg I. La Structure des fonctions de plusieurs variables sur un ensemble fini.C. R. Acad. Sci. Paris, 1965, (260): 3817–3819. (in French)

    MATH  MathSciNet  Google Scholar 

  6. Wang Xianghao. Structure theory of total and partial functions defined in a finite set.Acta Sc. Natur. Univ. Jiliensis, 1963, (2): 295–316. (in Chinese)

    Google Scholar 

  7. Luo Zhukai. The completeness theory of partial manyvalued logic functions.Acta Math. Sinica, 1984, 27(5): 676–683; Russian Translation Cybernetics Sbornik 1988, (25): 142–161.

    MATH  MathSciNet  Google Scholar 

  8. Luo Zhukai. All maximal subgroups defined by regular binary relations in symmetric group.Acta Math. Sinica. 1985, 28(6): 612–621.

    Google Scholar 

  9. Liu Renren, Luo Zhukai. The maximal closed classes of unary functions in p-valued logic.Mathematical Logic Quarterly, 1996, (42): 234–240.

    Article  MATH  MathSciNet  Google Scholar 

  10. Sheffer H M. A set of five independent postulates for Boolean algebras with application to logical constants.Trans. Am. Math. Soc., 1913, (14): 481–488.

    Article  MATH  MathSciNet  Google Scholar 

  11. Schofield P. Independent conditions for completeness of finite algebras with a single generator.J. London Math. Soc., 1969, 44: 413–423.

    Article  MATH  MathSciNet  Google Scholar 

  12. Kudrjavcev V B. The coverings of precomplete classes ofk-valued logic.Diskret. Analiz., 1970, 17: 32–44. (in Russian)

    MathSciNet  Google Scholar 

  13. Liu Renren. The minimal covering of precomplete classes in partial three-valued logic.Natur. Sci., J. Xiangtan Univ., 1991, 13(2): 158–164.

    MATH  MathSciNet  Google Scholar 

  14. Liu Renren. The minimal covering of precomplete classes in partial four-valued logic. InProc. ICYCS'91, 1991, pp.280–282.

  15. Liu Renren. Some results on the decision for Sheffer functions in partialK-valued logic.Multiple Valued Logic—An International Journal, 1996, 1, 253–269.

    MATH  Google Scholar 

  16. Liu Renren. Some results on the decision for Sheffer functions in partialK-valued logic (II). InProc. the 28th International Symposium on Multiple-Valued Logic, 1998, pp.77–81.

  17. Liu Renren. Research on the similarity among precomplete sets preservingm-ary relations in partialK-valued logic. InProc. the 29th Int. Symp. Multiple-Valued Logic, 1999, pp.136–139.

  18. Liu Renren. Some results on the minimal coverings of precomplete classes in partialK-valued logic functions. InProc. 2003 IEEE Int. Conf. Systems, Man & Cybernetics, 0-7803-7952-7/03 @2003 IEEE, pp.2645–2647.

Download references

Author information

Authors and Affiliations

  1. College of Information Science and Engineering, Central South University, 410083, Changsha, P.R. China

    Ren-Ren Liu, Song-Qiao Chen & Jian-Er Chen

  2. College of Information Engineering, Xiangtan University, 411105, Xiangtan, P. R. China

    Ren-Ren Liu

  3. College of Information Engineering, Shenzhen University, 518060, Shenzhen, P. R. China

    Shu Li

Authors
  1. Ren-Ren Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Song-Qiao Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jian-Er Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Shu Li
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Note

This work is supported by the National Natural Science Foundation of China (Grant Nos.60083001 and 60375021).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Liu, RR., Chen, SQ., Chen, JE. et al. Some results on the minimal coverings of precomplete classes in partialk-valued logic functions. J. Comput. Sci. & Technol. 19, 981–985 (2004). https://doi.org/10.1007/BF02973463

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02973463

Keywords

Search

Navigation