Download as pdf or txt
Download as pdf or txt
You are on page 1of 5

Question Bank-Unit 1

(Propositional Logic)
Bloom Diffi Competitive
’s culty Exam
S. No. Questions CO Taxon Leve Question
omy l Y/N
Level

1. Which of these sentences are propositions? What are the truth values of those that 1 K1 L N
are propositions? a) 2 + 3 = 5. b ) Answer this question.

2. Check whether these statements are well formed formula(wff) or not:(a) (p˅q) 2 K2 M N
∧∼r (b) p˅q∧r

3. Check whether these statements are wff or not: (a) (p∧(q∧r))→s (b) 2 K2 M N
((p˅q)∧r→q)

4. Determine whether these biconditionals are true or false. 2 K2 M N


a) 2 + 2 = 4 if and only if 1 + 1 = 2. b) 1 + 1 = 2 if and only if 2 + 3 = 4.

5. Determine whether these biconditionals are true or false. 2 K2 M N


a) 1 + 1 = 3 if and only if monkeys can fly. b) 0 > 1 if and only if 2 > 1.

6. Determine whether each of these conditional statements is true or false. 2 K2 M N


a) If 1 + 1 = 2, then 2 + 2 = 5. b) If 1 + 1 = 3, then 2 + 2 =
4.

7. Determine whether each of these conditional statements is true or false. 2 K2 M N


a) If 1 + 1 = 3, then 2 + 2 = 5. b) If monkeys can fly, then
1 + 1 = 3.
8. State the converse, contrapositive, and inverse of the conditional statements. 1 K1 L N
If it snows today, I will ski tomorrow.
9. State the converse, contrapositive, and inverse of each of these conditional 1 K1 L N
statements. I come to class whenever there is going to be a quiz.
10. State the converse, contrapositive, and inverse of the conditional statements. 1 K1 L N
A positive integer is a prime only if it has no divisors other than 1 and itself.
11. Let P(x) denote the statement “x ≤ 4.” What are these truth values? 2 K2 M N
a) P(4) b) P(6)
12. Let P(x) be the statement “x = x .” If the domain consists of the integers, what are
2
2 K2 M N
these truth values?
a) P(0) b) ∀xP(x)

13. Let P(x) be the statement “x = x2.” If the domain consists of the integers, what are 2 K2 M N
these truth values?
a) P(1) b) ∃xP(x)

14. Determine the truth value of each of these statements if the domain consists of all 2 K2 M N
integers.
a) ∀n(n + 1 > n) b) ∃n(2n = 3n)
15. Determine the truth value of each of these statements if the domain consists of all 2 K2 M N
integers.
a) ∃n(n = −n) b) ∀n(3n ≤ 4n)
16. Let p, q, r denote the statements “It is raining”, “It is cold”, and “It is pleasant”, 3 K3 M Y
respectively. Then the statement “It is not raining and it is pleasant, and it
is not pleasant only if it is raining and it is cold” is represented by
(a) (¬p ∧ r ) ∧ (¬r → (p ∧ q)) (b) (¬p ∧ r ) ∧ ((p ∧ q) →¬r)
(c) (¬p ∧ r ) ∨ ((p ∧ q) →¬r) (d) (¬p ∧ r ) ∨ (r → (p ∧ q))
17. Which one of the following is not equivalent to p↔q? 2 K2 M Y

(a) (¬p ∨ q ) ∧ (p ∨ ¬q) (b) (¬p ∨ q ) ∧ (q→ p)

(c) (¬p ∧ q ) ∨ (p ∧ ¬q) (d) (¬p ∧ ¬ q ) ∨ (p ∧ q)

18. Let p, q, and r be propositions and the expression (p→q) →r be a contradiction. 2 K2 M Y


Then the expression (r→p) →q is
(a) a tautology (b) a contradiction
(c) always TRUE when p is FALSE (d) always TRUE when q is TRUE
19. The statement (¬p) → (¬q ) is logically equivalent to : 2 K2 M Y
I. p → q II. q → p III. (¬q) ∨ p IV. (¬p) ∨ q
(a) I only (b) I and IV only
(c) II only (d) II and III only
20. Consider the following two statements: 3 K3 M Y

S1: If a candidate is known to be corrupt, then he will not be elected.

S2: If a candidate is kind, he will be elected.

Which one of the following statements follows from S1 and S2 as per


sound inference rules of logic?

(a) If a person is known to be corrupt, he is kind. (b) If a person is not known to


be corrupt, he is not kind.

(c) If a person is kind, he is not known to be corrupt. (d) If a person is not kind,
he is not known to be corrupt.

21. Let p,q,r,s represent the following propositions: 2 K2 M Y

p:x∈ {8,9,10,11,12}, q: x is a composite number, r: x is a perfect square, s: x is a


prime number.The integer x  2 which satisfies ¬((p→q ) ∧ (¬r ∨¬s) )
is……………………

22. Construct a truth table for each of these compound propositions. 2 K2 M N

a) (p → q) ↔ (¬q →¬p) b) (p → q) → (q → p)

23. Construct a truth table for each of these compound propositions. 2 K2 M N

a) (p ∨ q) → (p ⊕ q) b) (p ⊕ q) → (p ⊕¬q)

24. Use De Morgan’s laws to find the negation of each of the following 2 K2 M N
statements. a) Jasbir is rich and happy b) Rajan will bicycle or run
tomorrow.

25. i. Use De Morgan’s laws to find the negation of each of the 2 K2 M N


following statements. a) Shakila walks or takes the bus to
class. b) Ibrahim is smart and hard working.

26. Show that each of these conditional statements is a tautology by using 3 K3 M


truth tables. (And then without using the truth tables.)

a) (p ∧ q) → p b) p → (p ∨ q) c) ¬p → (p → q)

27. Show that each of these conditional statements is a tautology by using 3 K3 M N


truth tables. (And then without using the truth tables.)

(a) (p ∧ q) → (p → q) ( b) ¬(p → q) → p (c) ¬(p → q)→¬q


28. Show that (p → q) ∧ (q → r) → (p → r) is a tautology. 3 K3 M N
29. Show that two compound propositions are logically equivalent: 3 K3 M N

a) ¬(p ↔ q) and p ↔¬q b). ¬p ↔ q and p ↔¬q

c) ¬(p ↔ q) and ¬p ↔ q
30. Show that two compound propositions are logically equivalent: 3 K3 M N

(p → r) ∧ (q → r) and (p ∨ q) → r

31. Show that (p → q) → r and p → (q → r) are not logically equivalent. 3 K3 M N

32. Find the dual of each of these compound propositions. 2 K2 M N

a) p ∧¬q ∧¬r b) (p ∧ q ∧ r) ∨ s c) (p ∨ F) ∧ (q ∨
T)

33. Find the Disjunctive Normal Form (DNF) of (p ∨ q)→¬r. 2 K2 M N

34. Find the Disjunctive Normal Form (DNF) of (∼p →r)∧ (p↔ q). 3 K3 M N

35. Find the Disjunctive Normal Form (DNF) of p↔ (∼p ˅∼q). ). 3 K3 M N

36. Put the following into Conjunctive Normal form . 3 K3 M N

37. Put the following into Conjunctive Normal form (p∧q)˅(∼p∧q∧r) 3 K3 M N

38. Put the following into Conjunctive Normal form (p˅∼q)→q 3 K3 M N

39. Translate each of these statements into logical expressions using 3 K2 M N


predicates, quantifiers, and logical connectives.

a) No one is perfect.

b) Not everyone is perfect.

c) All your friends are perfect.

d) At least one of your friends is perfect.


e) Everyone is your friend and is perfect.

f ) Not everybody is your friend or someone is not perfect.

40. 1 K1 L N
Consider the argument:
“If you invest in the stock market, then you will get rich”
“if you get rich, then you will be happy”
therefore” if you invest in the stock market, then you will be happy”
check whether the given argument is valid.
41. Use rules of inference to show that the hypotheses “Randy works 2 K2 M N
hard,” “If Randy works hard, then he is a dull boy,” and “If
Randy is a dull boy, then he will not get the job” imply the
conclusion “Randy will not get the job.”

42. For each of these arguments, explain which rules of inference are used 2 K2 M N
for each step: “Danish, a student in this class, knows how to write
programs in JAVA. Everyone who knows how to write programs in
JAVA can get a high-paying job. Therefore, someone in this class can get
a high-paying job.”

43. Test the validity of the following argument: If philosopher is not 2 K2 M N


money-minded and some money-minded persons are not clever,
then there are some persons who are neither philosopher nor clever.

44. Prove that if n is an integer and 3n+2 is odd, then n is odd. 3 K3 M N

45. Give a direct proof of the theorem “If n is an odd integer, then n2 is 3 K3 M N
odd.”
46. Prove that if n is an integer the n2 is odd iff n is odd. 3 K3 M N

47. Prove that is irrational by giving a proof by contradiction. 3 K3 M N

48. Give a proof by contradiction of the theorem “If 3n+2 is odd, then n 3 K3 M N
is odd”.

You might also like