By Topic

Functional completeness and weak completeness in set 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

3 Author(s)
Simovici, D. ; Math. & Comput. Sci., Massachusetts Univ., Boston, MA, USA ; Stojmenovic, I. ; Tosic, R.

The functional completeness problems in r-valued set logic, which is the logic of functions mapping n-tuples of subsets into subset over r values, is discussed. It is shown that r-valued set logic is isomorphic to 2r-valued logic, meaning that the well-known completeness criteria in multiple-valued Post algebras apply to set-valued logic. Since Boolean functions are convenient choice as building blocks in the design of set logic functions, the notion of weak completeness of a set is introduced; i.e., a set is weak complete if it becomes complete once all Boolean functions are added to the set. A full description of weak complete sets, weak maximal sets, weak bases, and weak Sheffer functions is given for the case of two-valued set logic

Published in:

Multiple-Valued Logic, 1993., Proceedings of The Twenty-Third International Symposium on

Date of Conference:

24-27 May 1993