1) A statement that can be either true or false is called:

A) Expression

B) Proposition

C) Predicate

D) Argument

2) Which of the following is a compound statement?

A) x > 2

B) It is raining

C) p ∧ q

D) x = 5

3) The logical connective for AND is:

A) ∨

B) →

C) ↔

D) ∧

4) The truth value of p ∨ q is false when:

A) p is true, q is false

B) p is false, q is true

C) both p and q are false

D) both p and q are true

5) The negation of p → q is:

A) ¬p → ¬q

B) p ∧ ¬q
 C) ¬p ∨ q

D) q → p

6) Which is the converse of p → q?

A) q → p

B) ¬p → ¬q

C) p ∧ q

D) ¬q → ¬p

7) Which is the contrapositive of p → q?

A) q → p

B) ¬p → ¬q

C) ¬q → ¬p

D) p ∧ q

8) A statement that is always true is called:

A) Contradiction

B) Contingency

C) Tautology

D) Fallacy

9) p ∧ ¬p is an example of:

A) Tautology

B) Equivalence

C) Contradiction

D) Implication

10) Which law states ¬(p ∧ q) ≡ ¬p ∨ ¬q?

B) De Morgan’s law

C) Absorption law

D) Distributive law

11) A predicate becomes a proposition when:

A) A variable is introduced

B) A variable is assigned a value

C) It is negated

D) Quantifier is removed

12) ∀x P(x) means:

A) P(x) is false

B) P(x) for some x

C) P(x) for all x

D) P(x) for no x

13) ∃x P(x) means:

A) For all x P(x)

B) There exists x such that P(x)

C) No x satisfies P(x)

D) Exactly one x satisfies P(x)

14) The negation of ∀x P(x) is:

A) ∀x ¬P(x)

B) ∃x ¬P(x)

C) ¬∃x P(x)

D) ∃x P(x)
15) The negation of ∃x P(x) is:

A) ∀x ¬P(x)

B) ∃x ¬P(x)

C) ¬∀x P(x)

D) ∀x P(x)

16) Order of quantifiers affects meaning in:

A) ∀x ∃y P(x,y)

B) ∃y ∀x P(x,y)

C) Both A and B

D) None

17) If p → q and p are true, then q is true. This is:

A) Modus Tollens

B) Modus Ponens

C) Hypothesis

D) Addition

18) If p → q and ¬q, then ¬p is:

A) Modus Ponens

B) Simplification

C) Modus Tollens

D) Syllogism

19) From p we can infer p ∨ q. This is:

A) Simplification

B) Conjunction

C) Addition
 D) Resolution

20) From p ∧ q we can infer p. This is:

A) Addition

B) Simplification

C) Modus Ponens

D) Syllogism

21) A set with no elements is called:

A) Singleton set

B) Universal set

C) Null set

D) Power set

22) The number of elements in a set is called:

A) Degree

B) Cardinality

C) Order

D) Dimension

23) If A ⊆ B and A ≠ B, then A is:

A) Improper subset

B) Universal set

C) Proper subset

D) Power set

24) The power set of a set with n elements has:

A) n elements

B) 2n elements

C) n² elements
 D) 2ⁿ elements

25) A × B represents:

A) Union

B) Intersection

C) Cartesian product

D) Difference

26) A function where every element of codomain is mapped is:

A) Injective

B) Surjective

C) Bijective

D) Partial

27) A function that is both injective and surjective is:

A) Many-one

B) Into

C) Bijective

D) Constant

28) The inverse of a function exists only if the function is:

A) Injective

B) Surjective

C) Bijective

D) Constant

29) A relation represented using rows and columns is:

A) Graph

B) Arrow diagram

C) Matrix
 D) Set-builder

30) A relation R is reflexive if:

A) (a,b) ∈ R

B) (a,a) ∈ R for all a

C) (b,a) ∈ R

D) None

31) The set of even prime numbers is __________

A) {2, 4, 6}

B) {0, 2, 4}

C) {1, 3, 5}

D) {2}

32) Every subset of a finite set is

A) Disjoint

B) Null

C) Finite

D) Infinite

33) The symbol used for intersection in set theory is represented by

A) /

B) ∩

C) ∪

D) None

34) Statement which is always true is called

A) Tautology

B) Absurdity

C) Contingency
 D) None

35) ~(p ∧ q) = _____________

A) ~p ∧ ~p

B) q ∧ p

C) ~p ∧ ~q

D) p ∧ q

36) The set of real numbers is

A) N ∪ W

B) N ∪ Z

C) Q ∪ Q' (where Q' is irrationals)

D) Q ∪ Z

37) The empty set is denoted by the symbol

A) {}

B) {0}

C) {{}}

D) ∅

38) If A is subset of B then it can be written symbolically as

A) A ⊇ B

B) A ⊆ B

C) A ⊈ B

D) A = B

39) Logic in which there is a scope for third or fourth possibility is called:

A) Aristotelian logic

B) Non-Aristotelian logic
 C) Leibniz logic

D) Non-Leibniz logic

40) q → p is called the converse of

A) ~p → q

B) p → q

C) q → p

D) ~p ~q

41) The contrapositive of p → q is

A) ~p → q

B) q → p

C) ~q → ~p

D) p → q

42) A statement tautology is denoted by

A) t

B) c

C) p

D) none of these

43) If A ∩ B = ∅ then sets are called ___________

A) disjoint sets

B) sub sets

C) overlapping sets

D) None

44) If A ∩ B ≠ ∅ then sets are called ___________

A) disjoint sets
 B) sub sets

C) overlapping sets

D) None

45) √2 is set of _____ numbers.

A) Irrational

B) Rational

C) Prime

D) Composite

46) Composite numbers are those numbers whose divisors are ______

A) 1

B) More than 2

C) 0

D) None of these

47) Prime numbers are those numbers whose divisors are _________

A) Two

B) One

C) Three

D) Four

48) 3.1416 ________ is a __________ number

A) Rational

B) Irrational

C) Real

D) None

49) The symbol of conjunction is

A) ∧
 B) ∨

C) ~

D) →

50) The symbol of negation is

A) ~

B) ∨

C) ∧

D) None
Question
Correct Answer Brief Explanation (where needed)
No.
A proposition is a declarative statement that is either
1 B) Proposition
true or false.
Compound statements are formed by combining
2 C) p ∧ q
simple statements using connectives.
3 D) ∧ ∧ is the symbol for logical AND.
C) both p and q are
4 Disjunction (OR) is false only when both are false.
false
Negation of implication p → q is equivalent to p
5 B) p ∧ ¬q
true and q false.
6 A) q → p Converse swaps hypothesis and conclusion.
7 C) ¬q → ¬p Contrapositive negates and swaps.
8 C) Tautology A statement that is always true.
9 C) Contradiction p ∧ ¬p is always false.
10 B) De Morgan’s law One of De Morgan's laws.
B) A variable is Assigning a value to the variable turns the predicate
11
assigned a value into a proposition.
12 C) P(x) for all x Universal quantifier ∀ means "for all".
B) There exists x such
13 Existential quantifier ∃ means "there exists".
that P(x)
Negation of "for all" is "there exists a
14 B) ∃x ¬P(x)
counterexample".
15 A) ∀x ¬P(x) Negation of "there exists" is "for all not".
16 C) Both A and B Order matters in mixed quantifiers (∀∃ vs ∃∀).
17 B) Modus Ponens p → q, p ⊢ q.
18 C) Modus Tollens p → q, ¬q ⊢ ¬p.
19 C) Addition From p, you can add any q to get p ∨ q.
20 B) Simplification From conjunction p ∧ q, you can take either part.
21 C) Null set Empty set has no elements; denoted ∅.
22 B) Cardinality Number of elements in a set.
23 C) Proper subset Subset but not equal.
24 D) 2ⁿ elements Power set has 2^n subsets.
25 C) Cartesian product A × B is ordered pairs.
26 B) Surjective Every element in codomain is hit (onto).
27 C) Bijective One-to-one and onto.
28 C) Bijective Inverse exists only for bijections.
29 C) Matrix Relations can be represented by adjacency matrices.
30 B) (a,a) ∈ R for all a Reflexive requires every element related to itself.
 Question
Correct Answer Brief Explanation (where needed)
No.
31 D) {2} Only even prime number is 2.
32 C) Finite Subsets of finite sets are finite.
33 B) ∩ Standard symbol for intersection.
34 A) Tautology Always true statement.
35 C) ~p ∧ ~q De Morgan's law.
36 C) Q ∪ Q' Real numbers = rationals ∪ irrationals.
Standard notation for empty set (also {} is
37 D) ∅
acceptable, but ∅ is precise).
38 B) A ⊆ B Subset symbol.
B) Non-Aristotelian Allows more than two truth values (e.g., fuzzy or
39
logic multi-valued logic).
40 B) p → q q → p is the converse of p → q.
41 C) ~q → ~p Contrapositive.
42 A) t Tautology is often denoted by t or T.
43 A) disjoint sets Intersection empty.
44 C) overlapping sets Intersection non-empty.
45 A) Irrational √2 is irrational.
Composite numbers have more than two distinct
46 B) More than 2
positive divisors.
Primes have exactly two distinct positive divisors (1
47 A) Two
and itself).
48 A) Rational 3.1416 is a terminating decimal, hence rational.
49 A) ∧ Conjunction symbol.
50 A) ~ Negation symbol.