A Ternary Switching Theory with only Three Primitives

Abstract

Many-valued algebra of Post is used to develop a ternary switching theory. The theory presented makes use of only three primitives defined by Post. A canonical form for expressing any arbitrary switching function is proposed along with the proof of functional completeness of these primitives.

Indexing Terms:

• Ternary Switching Functions
• Many-Valued Ternary Logic
• 3-Valued Logic

Additional information

Notes on contributors

M.R. Bhujade

Bhujade, M R: Graduated in Electrical Engineering from VRCE, Nagpur in 1970. He passed his M Tech, degree in Electrical Engineering from IIT, Bombay in 1972 and worked at Radio Astronomy Centre, Ooty as computer engineer till April 1973. Presently he is a lecturer in the Computer Centre, 1IT, Bombay. His research interests include computer communications, computer architecture, many-valued logic, fault diagnosis, and microprocessors and applications.

J.R. Isaac

Isaac, J R: BE Degree from Mysore University, and MS from Carnegie Institute of Technology (now Carnegie-Mel(on), Pittsburgh, USA. Worked at the IBM Research Laboratories, Poughkeepsie, NY, USA. Taught at the University of Ceylon for three years, and joined IIT, Bombay in 1961. Presently Professor in Computer Science, and Dean of Student Affairs. Research interests: computer architecture, fault-tolerant computing and advanced computer applications. Presently Vice-President of the Computer Society of India.