[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content
Springer Nature Link
Log in

On the Categorizing of Simply Separable Relations in Partial Four-Valued Logic

  • Conference paper
Advances in Natural Computation (ICNC 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3612))

Included in the following conference series:

Abstract

In completeness theories of multiple-valued logic, the characterization of Sheffer functions is an important problem, and the solution can be reduced to determining the minimal coverings of precomplete categories. It’fs well known that each precomplete set is a function set, T(G m ), preserving the relation G m , therefore, the categorizing of this relation has provided the determination of precomplete set’s minimal covering with more convenient ways. In this paper, simply separable relations in partial four-valued logic are categorized by similar relation.

This work is supported by the National and Hunan Province Natural Science Foundation of China ( 60083001,60375021, 60433020, 03JJY3099).

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Sheffer, H.M.: A Set of Five Independent Postulates for Boolean Algebras with Application to Logical Constants. Trans. Am. Math. Soc. 14, 481–488 (1913)

    Article  MATH  MathSciNet  Google Scholar 

  2. Liu, R.: The Minimal Covering of Precomplete Sets in Partial Three-Valued Logic. Natur. Sci. J. Xiangtan Univ. 13(2), 158–165 (1991) MR92g:03035 03B50

    MATH  MathSciNet  Google Scholar 

  3. Liu, R.: Some Results on the Decision for Sheffer Functions in Partial K-Valued Logic. Multiple Valued Logic-An International Journal 1, 253–269 (1996)

    MATH  Google Scholar 

  4. Liu, R.: Some Results on the Decision for Sheffer Functions in Partial K-Valued Logic. In: Proceedings of the 28th International Symposium on Multiple-Valued Logic (II), pp. 77–81 (1998)

    Google Scholar 

  5. Liu, R.: Research on the Similarity among Precomplete Sets Preserving m-ary Relations in Partial K-Valued Logic. In: Proceedings of the 29th International Symposium on Multiple-Valued Logic, pp. 77–81 (1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Information Engineering, Xiangtan University, Xiangtan, Hunan, 411105, China

    Renren Liu, Zhiwei Gong & Fen Xu

Authors
  1. Renren Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhiwei Gong
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Fen Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Electrical and Electronic Engineering, Nanyang Technological University, Block S1, Nanyang Avenue, 639798, Singapore

    Lipo Wang

  2. School of Software, Sun Yat-Sen University, 510275, Guangzhou, China

    Ke Chen

  3. School of Computer Engineering, Nanyang Technological University, BLK N4, 2b-39, Nanyang Avenue, 639798, Singapore

    Yew Soon Ong

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Liu, R., Gong, Z., Xu, F. (2005). On the Categorizing of Simply Separable Relations in Partial Four-Valued Logic . In: Wang, L., Chen, K., Ong, Y.S. (eds) Advances in Natural Computation. ICNC 2005. Lecture Notes in Computer Science, vol 3612. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11539902_159

Download citation

  • DOI: https://doi.org/10.1007/11539902_159

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28320-1

  • Online ISBN: 978-3-540-31863-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation