Computer Science

Truth Tables

Truth tables are a simple way of visualizing the result of some boolean operation. Boolean operations required either a True or False value as input, and result in either True or False. Truth tables are a graphical way of showing those operations.

Boolean Fundamentals

There are only three basic operations that make up Boolean arithmetic: AND (∧), OR (∨) and NEGATION (¬).

NEGATION Operation

Negation is the simplest of the three basic operations. Also known as the NOT operation, negation simply flips the value of its input value, as shown in the truth table below:

A ¬A
True False
False True

As you can see, the negation operation simply flips the value so NOT TRUE become FALSE and NOT FALSE becomes TRUE

OR Operation

The OR operation takes two operands and returns the True as long as AT LEAST one of them is True. This can be seen in the truth table below:

A B A ∨ B
True True True
True False True
False True True
False False False

AND Operation

The AND operation, like the OR operation, takes two operands. However, it only returns True if BOTH its operands are true, as shown in the truth table below:

A B A ∧ B
True True True
True False False
False True False
False False False

Comments

This site uses Akismet to reduce spam. Learn how your comment data is processed.

%d bloggers like this: