P-Functions-Ternary Logic Functions Capable of Correcting Input Failures and Suitable for Treating Ambiguities
Issue No. 01 - January (1992 vol. 41)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.123380
<p>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.</p>
P-functions; ternary logic functions; input failures; ambiguities; regular ternary logic; all-prime-implicant disjoint; Boolean connective; irredundant disjunctive form; Boolean functions; ternary logic.
M. Mukaidono and Y. Yamamoto, "P-Functions-Ternary Logic Functions Capable of Correcting Input Failures and Suitable for Treating Ambiguities," in IEEE Transactions on Computers, vol. 41, no. , pp. 28-35, 1992.