1 |
|
|
2 |
Truth table containing all the values true is called: |
absurdity
conjunction
tautology
none
|
3 |
|
|
4 |
|
|
5 |
|
|
6 |
A biconditional is written in symbols as: |
|
7 |
A declarative statement which is either true or false but not both is called: |
logic
proposition
induction
deduction
|
8 |
To draw general conclusions from well-known facts is called: |
logic
proposition
induction
deduction
|
9 |
To draw general conclusions from a limited number of observations is called: |
logic
proposition
induction
deduction
|
10 |
A statement which is true for all possible values of the variables involved in it, is called a: |
tautology
conditional
implication
absurdity
|
11 |
A compound statement of the form "if p then q" is called an: |
tautology
conditional
consequent
absurdity
|
12 |
The number of subsets of a set having three elements is: |
2
3
4
8
|
13 |
If n(S) = 3 then n {P(S)} = |
2
8
16
4
|
14 |
|
A
B
|
15 |
|
B
A
none of these
|
16 |
B - A is a subset of: |
A
B
|
17 |
A - B is a subset of: |
A
B
|
18 |
|
A
B
|
19 |
|
A
B
|
20 |
|
A and B are power sets
A and B are disjoint sets
A and B are super sets
A and B are equal sets
|