By Topic

Full Symmetric Function in Partial K-Valued Logic

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Jian-quan Ouyang ; Xiangtan Univ., Xiangtan

The functional completeness problems of the partial K-valued logic functions have a wide range of applications including cryptography and the real combinatorial circuits design. It includes the decision and construction for Sheffer functions in P, and the solution of the problems depends on determining all precomplete classes in P, and reduces to determine the minimal cover of the union of all precomplete classes in P. An n-ary function f is a Sheffer function if and only if f does not belong to any other precomplete classes in P. Hence, it is important to determine the minimal cover of the union of all precomplete classes on partial K-valued logic functions in on studying Sheffer Function. In this paper, some full symmetric function sets (m=k)are proved to be the component of the minimal cover of the union of all precomplete classes in P.

Published in:

Fuzzy Systems and Knowledge Discovery, 2008. FSKD '08. Fifth International Conference on  (Volume:1 )

Date of Conference:

18-20 Oct. 2008