After having built my first 8 two-input logic gates, I needed to figure out what to name them. The first four, Min, Max, Antimin, and Antimax came from Dr. Jones' work here. The next four were nameless, but very similar to the first four. I realized I didn't really have a full grasp of the relationship between binary and ternary and needed to learn a bit more about "-arity" as an abstract. This took me into symbolic logic.
In symbolic logic a binary system has 16 different "connectives". These are what we know as the logic gates. Mathematicians call them connectives because they connect statements. For example: Joe ate apples AND oranges. The logic gate is the connective. In a ternary system, nobody could ever hope to name all 19,683 connectives, but each of the binary connectives does have an analog in the set of ternary gates; a ternary gate "most like" the binary connective. This was mildly interesting and since looking over the subject had revealed the very useful datum that I had a functionally complete set of gates, I decided to look deeper and find the ternary gate that corresponded to each of the 16 binary connectives.
For two inputs, P and Q, these are the 16 connectives.
Symbolic Name | Binary Gate | Ternary Gate |
Tautology | Output is always 1 | Output is always + |
Contradiction | Output is always 0 | Output is always - |
Proposition P | Output is always equal to P | Output is always equal to P |
Proposition Q | Output is always equal to Q | Output is always equal to Q |
Negation P | Output is always opposite of P | Output is always the simple inversion of P |
Negation Q | Output is always opposite of Q | Output is always the simple inversion of Q |
Conjunction | AND gate | Min gate |
Disjunction | OR gate | Max gate |
Alternative Denial | NAND gate | Antimin gate |
Joint Denial | NOR gate | Antimax gate |
Implication | NOR gate with P input negated | Implication |
Nonimplication | Implication gate with output negated | Nonimplication |
Converse Implication | NOR gate with Q input negated | Converse Implication |
Converse Nonimplication | Converse Implication gate with output negated | Converse Nonimplication |
Exclusive Disjunction | XOR gate | XOR (I haven't built this one yet) |
Biconditional | XNOR gate | XNOR (I haven't built this one yet) |
In a ternary system the first 6, Tautology - Negation Q, are trivial and consist of connections to signal reference voltages, the buffer(P), and the simple inverter(5). The next 8 are combinations of the buffer and simple inverter. The final two, Exclusive Disjunction and Biconditional are a bit more complicated and I have not built them yet.
With the possible exception of XOR and XNOR, I can build all of the ternary equivalents to the binary system with nothing but combinations of the buffer and the simple inverter. I already know that The Min gate, Max gate, and the monadics "Is False", "Is Unknown", and "Is True" form a functionally complete set, but Min and Max are combinations of the buffer and the simple inverter. So really, just those five monadic gates are a functionally complete set. I'm highly suspicious that I'll be able to make the ternary equivalents of XOR and XNOR with just the 5 and P as well.
Discussions
Become a Hackaday.io Member
Create an account to leave a comment. Already have an account? Log In.
Thank you for these posts. They have greatly helped me to understand ternary logic and computing.
Are you sure? yes | no