www.sakshieducation.

com

Statements and Sets

The terms which connect two statements are called
If the switch P is OFF we represent it by
The complement law using is
The truth value of (3 2) (2 = 3) is
The statement of the form If ...... then ....... is called as
A combination of one or more simple statements with a connective is called a
The symbol for existential quantifier
~ (p q) =
The contrapositive of If a polygen is a square then it is a rectangle is
p, q, r are threee statements then p (q r) = (p q) (q r) is law.
For all or For every is called quantifier.
If p and q are switches. The combination of p q is called

13.

p and q are two statements. The symbolic form of Converse of a conditional is equivalent to its inverse is
The statement which uses the connective OR is called a
The truth value of (4 7 = 20) (4 7 = 1) is
P is the statement then ~ (~ (~ p)) is
The symbolic form of If x is not odd then x2 is odd
p: It is raining, q: The sun is shining . Connect p, q using conjuction is
Denial of a statement is called its
p and q are two statements then example for Tautology is
p (~ p) is very simple example of a
~ (p q )
p p = p. This is law.
The symbol of Universal Quantifier is
~ (p q) (~ p) (~ q) is law.
p (q r) (p q) (p r) is law.
The truth value of implication statement :
If 3 2 = 5 then 1 0 = 0 is
The last column of truth table contains only F it is called
p or not p is example for
The inverse of ~ p ~ q is

w
w
w
.s
ak
sh
ie
du
ca
ti
on
.c
om

1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
11.
12.

14.
15.
16.
17.
18.
19.
20.
21.
22.
23.
24.
25.
26.
27.

28.
29.
30.

www.sakshieducation.com

www.sakshieducation.com

KEY
2) P1
4) True
6) Compound statement
8) ~ p q (or) p ~q
10) Distributive law
12) Parallel combination
14) Disjuction
16) ~ p
18) p q
20) p (~ q)
22) ~ p ~ q
24)
26) Distributive law
28) Contradiction
30) p q

w
w
w
.s
ak
sh
ie
du
ca
ti
on
.c
om

1) Connectivities
3) (p (~ p)) f
5) Conditional (or) Implication
7)
9) If a polygon is not a rectangle then it is not a square
11) Universal
13) (q p) ~ (p q)
15) True
17) x is not odd x2 is odd
19) Negation
21) Contradiction
23) Idempotent law
25) De morgans law
27) True
29) Tautology

SETS

1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
11.
12.
13.
14.
15.
16.
17.
18.
19.
20.

If A and B are disjoint sets, then n(A B) =

If A B then A B =
The complement of is
n () =
If A B then A B =
If A B and BA then
A A1 =
If A B and n(A) = 5, n (B) = 6 then n (A B) =
The set builder form of B = {1, 8, 27, 64, 125} is
(A B)1 =
If A = {3, 4}, B = {4, 5} then n (A B) =
(A B) (A C) =
If A sand B are two sets then A B =
If A B, n (A) = 10 and n (B) = 15 then n (A B) =
If A B = , n (A B) = 12 then n (A B) =
If A, B, C are three sets A (B C) =
n (A B) = 8, n (A B) = 2, n (B) = 3 then n (A) =
If A = {x ; x 5, x N}, B = {2, 3, 6, 8} then A B =
If A, B are disjoint sets n (A) = 4, n (AB) = 12 then n (B) =
(A B) = A1 B1 is law.
www.sakshieducation.com

www.sakshieducation.com

A, B are two sets then x (A B) =

A B and n (A) = 5, n (B) = 6 then n (A B) =
The sets which are having same cardnial numbers are called
If A has n elements then the number of elements in proper sub set is
If A and B are disjoint sets then n (A B) =
If n (A) = 7, n (B) = 5 then the maximum number of elements in A B is
If A B = then B A =
If any law of quality of sets, if we interchange and and and the resulting law also
true, this is known as
A B1 =
A, B are subsets of then A B1 =

w
w
w
.s
ak
sh
ie
du
ca
ti
on
.c
om

21.
22.
23.
24.
25.
26.
27.
28.
29.
30.

KEY

1) n (A) + n (B)
3)
5) B
7)
9) {x / x = n3, n N, n 5}
11) 4
13) (A B) (A B) (or) (A B) (B A)
15) 12
17) 7
19) 8
21) x A and x B
23) Equivalent sets
25) 0
27) B
29) A B

2) A
4) 0
6) A = B
8) 6
10) A1 B1
12) A (B C)
14) 0
16) (A B) (A C)
18) {2, 3}
20) De Morgans law
22) 6
24) 2n 2
26) 5
28) Principle of duality
30) A B

www.sakshieducation.com