2.

1 Classical Set Theory and Boolean Algebra 17

2.1.2 Laws of Set Theory

Some important laws of set theory are enumerated in Table 2.1.

Table 2.1 Laws of set theory

Name Description
Identity law A = A; A U = U
A = ; A U = A
Idempotency law AA=A
AA=A
Commutative law AB=BA
AB=BA
Associative law A (B C) = (A B) C
A (B C) = (A B) C
Distributive law A (B C) = (A B) (A C)
A (B C) = (A B) (A C)
Complementation law A A =U
A A =
A=A
De Morgans laws ( A B) = A B
( A B) = A B

2.1.3 Boolean Algebra

Boolean algebra finds its extensive use in evaluation of reliability and safety pro-
cedures due to consideration that components and system can present in either
success or failure state. Consider a variable X that denotes the state of a compo-
nent and assume 1 represents success and 0 represents failure. Then, the probabil-
ity that X is equal to 1 P(X = 1) is called the reliability of that particular compo-
nent. Depending upon the configuration of the system, it will also have a success
or failure state. Based on this binary state assumption, Boolean algebra can be
conveniently used.
In Boolean algebra all the variables must have one of two values, either 1 or 0.
There are three Boolean operations, namely, OR, AND, and NOT. These opera-
tions are denoted by +, (dot), and (superbar over the variable) respec-
tively. A set of postulates and useful theorems are listed in Table 2.2, where x1, x2,
x3 denote variables of a set X.