Grey sets and greyness

This paper discusses the application of grey numbers for uncertainty representation. It highlights the difference between grey sets and interval-valued fuzzy sets, and investigates the degree of greyness for grey sets. It facilitates the representation of uncertainty not only for elements of a set, but also the set itself as a whole. Our results show that a grey set could be specified for interval-valued fuzzy sets or rough sets under special conditions. With the notion of grey sets and their associated degrees of greyness, various set operations between grey sets are discussed

Fredkin Gates for Finite-valued Reversible and Conservative Logics

The basic principles and results of Conservative Logic introduced by Fredkin and Toffoli on the basis of a seminal paper of Landauer are extended to d-valued logics, with a special attention to three-valued logics. Different approaches to d-valued logics are examined in order to determine some possible universal sets of logic primitives. In particular, we consider the typical connectives of Lukasiewicz and Godel logics, as well as Chang's MV-algebras. As a result, some possible three-valued and d-valued universal gates are described which realize a functionally complete set of fundamental connectives.Comment: 57 pages, 10 figures, 16 tables, 2 diagram