1.4.3 Boolean Algebra

A form of algebra where all values are TRUE or FALSE

Takes one input and reverses it

Returns TRUE if both conditions are true, if not it returns FALSE

Returns TRUE if either condition is true or FALSE when both conditions are false

Is TRUE when one or the other input is true but FALSE if both are

A method of representing every possible output based on the inputs of a Boolean expression

Laws used to manipulate and simplify Boolean expressions

—(A v B) = —A n —B

—(A n B) = —A v —B

A Boolean law that allows you to group variable into brackets and break brackets again

A Boolean law that makes the order of the variable not matter

A Boolean law that allows you to multiply or factor out an expression just like normal algebra

A Boolean law that’s used to reduce a complicated expression into a similar, simple one

X = ——X X = Not Not X

An alternative way of simplifying Boolean expressions

Adds together two inputs, can only add the inputs

Is able to add two single bit numbers and an incoming carry bit. It outputs a bit and a carry

A circuit or logic design which can be viewed as a memory cell