The authors consider a new class of special ternary logic functions: the P-functions capable of correcting input failures, based on the regular ternary logic. There are three major results. First, the P-functions are a special subset of the regular functions with no information loss. Second a ternary logic function defined by the all-prime-implicant disjoint of any Boolean connective is a P-function. Third, a P-function may be identified from the irredundant disjunctive form. The relationship between P-functions and other meaningful ternary logic functions is discussed.>

In a previous paper (Trans. IECE Japan, vol.J63-D, p.493-500, 1980, vol.J64-D, p.172-3, 1981 and vol.E-67, p.47-8, 1984), the authors defined a new class of multiple-valued logic functions, called multiple-valued majority functions. The authors clarifies the distinction of multiple-valued majority functions from multiple-valued threshold functions through the difference between a number function and an inner product of an input vector and a weight vector.>

Special ternary logic functions, namely, regular functions suitable for treating ambiguity and majority functions based on an extended majority principle are considered. The one-to-one correspondence between n-ary monotone regular ternary logic functions and (n+1)-ary monotone Boolean functions is investigated, as well as the one-to-one correspondence between n-ary monotone ternary majority functions and (n+1)-ary monotone binary threshold functions. The ternary majority functions are enumerated.>