About Ternary Inverter Gates

In the binary code, an inverter is a logic gate which implements logical negation (see wiki). As we have only two values (zero and one), the truth table is very simple: zero becomes one and one becomes zero. Since we are using the Boolean logic, no more options are available. This gate is also called NOT gate.

In Symmetric Ternary logic, 5 inverters can be made. We will consider only three of them because these gates are used in ternary computing.

The first gate is called Simple Ternary Inverter or STI. We described it in one of earlier post. The truth table for it looks like this:

There exists also a Positive Ternary Inverter or PTI. The truth table is represented below:

Finally, we have the Negative Ternary Inverter or NTI. The truth table looks like this:

The combination of these logic gates with other ones can produce the circuits that we need in ternary calculations, such as cycles. We will discuss them in another post. For now see below a short video how these three gates works. I connected NTI and PTI to the output of STI:

Next time we will continue building this circuit to make a program counter.