Basic Laws of Boolean Algebra

About this set

Created by:

d_michel  on November 30, 2011

Subjects:

AP Computer Science A

Log in to favorite or report as inappropriate.
Pop out
No Messages

You must log in to discuss this set.

Basic Laws of Boolean Algebra

Commutative
A || B = B || A
A && B = B && A
1/11
Preview our new flashcards mode!

Study:

Cards

Speller

Learn

Test

Scatter

Games:

Scatter

Space Race

Tools:

Export

Copy

Combine

Embed

Order by

Terms

Definitions

Commutative A || B = B || A
A && B = B && A
Distributive A || (B && C) = (A || B) && (A || C)
A && (B || C) = (A && B) || (A && C)
Identity A || 0 = A
A && 1 = A
Inverse A || !A = 1
A && !A = 0
Idempotent A || A = A
A && A = A
Boundedness A || 1 = 1
A && 0 = 0
Absorption A || (A && B) = A
A && (A || B) = A
Associative A || (B || C) = (A || B) || C
A && (B && C) = (A && B) && C
Involution ! (!A) = A
Derived A || (!A && B) = A || B
A && (!A || B) = A && B
DeMorgan's! (A || B || C....) = !A && !B && !C &&....)
! (A && B && C &&....) = !A || !B || !C ||....

! (A || B) = !A && !B
The NOT of the Ors equals the AND of the NOTs.
"Since it is false that either thing is true, then both things must be false."
! (A && B) = !A || !B
The NOT of the ANDs equals the OR of the NOTs.
"Since it is false that two things together are true, at least one of them must be false."

First Time Here?

Welcome to Quizlet, a fun, free place to study. Try these flashcards, find others to study, or make your own.

Set Champions

Scatter Champion

26.9 secs by d_michel