Regular Ternary Logic Functions --- Ternary Logic Functions Suitable for Treating Ambiguity,

reportActive / Technical Report | Accession Number: ADP002366 | Need Help?

Abstract:

A special group of ternary functions, called regular ternary logic functions, are defined. These functions are useful in switching theory, programming languages, algorithm theory and many other fields, if we are concerned with the indefinite state in such fields. This paper describes the fundamental properties and representations of the regular ternary logic functions. Author

Author(s):
Mukaidono, M.
Author Organization(s):
MEIJI UNIV TOKYO (JAPAN)*
Supplementary Note:
This article is from 'Proceedings of the International Symposium on Multiple-Valued Logic (13th) Held at Kyoto, Japan on May 23-25, 1983,' AD-A136 457, p286-291.
Pagination:
0006

Security Markings

DOCUMENT & CONTEXTUAL SUMMARY

Distribution:
Approved For Public Release

RECORD

Collection: TR
Subject Terms
Communities of Interest:
No COI(s) Identified
Descriptor(s):
*Mathematical logic, *Algorithms, *Switching, *Theory, *Symposia, Programming languages, Binary notation, Japan
Keyword(s):
Component Reports, Multiple valued logic, Ternary logic, Logic functions, Functions(Ternary), Regular functions, Sequential circuits, Ambiguities, Notation(Ternary), Algorithms(Ternary), Functions(Logic), Truth tables, Majority functions, Nonregular functions, And(Ternary), Or(Ternary), Not(Ternary)
Report Date:
1983 May 01