Practice Set Unit 1

Question Bank-Unit 1
(Propositional Logic)
Bloom Diffi Competiti Area Topic U M
’s culty ve Exam n a
Questions CO Taxon Leve Question it r
omy l Y/N k
Level s
Which of these sentences are propositions? What are the truth values of those that 1 K1 L N 1 2
are propositions? a) 2 + 3 = 5. b ) Answer this question. (1/12/KR)
Determine whether these biconditionals are true or false. 1 K2 L N 1 2

a) 1 + 1 = 3 if and only if monkeys can fly. b) 0 > 1 if and only if 2 > 1.
(16/14/KR)
Determine whether each of these conditional statements is true or false. 1 K2 L N 1 2

a) If 1 + 1 = 2, then 2 + 2 = 5. b) If 1 + 1 = 3, then 2 + 2 = 4.
(17/14/KR)
State the converse, contrapositive, and inverse of the conditional statements. 1 K2 L N 1 2

If it snows today, I will ski tomorrow.
(27/15/KR)
State the converse, contrapositive, and inverse of each of these conditional 1 K2 M N 1 6

statements.
I come to class whenever there is going to be a quiz.
(27/15/KR)
Let P(x) denote the statement “x ≤ 4.” What are these truth values? 1 K2 L N 1 2
a) P(4) b) P(6) (1/53/KR)
.Let P(x) be the statement “x = x2.” If the domain consists of the integers, what are 1 K2 L N 1 2
these truth values?
a) P(0) b) ∀xP(x) (11/53/KR)
Determine the truth value of each of these statements if the domain consists of all 1 K2 L N 1 2
integers.
a) ∃n(n = −n) b) ∀n(3n ≤ 4n) (13/53/KR)
Let p, q, r denote the statements “It is raining”, “It is cold”, and “It is pleasant”, 1 K3 H Y 1 6
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))
(GATE 2017, 1 mark)
Which one of the following is not equivalent to p↔q? 1 K2 M Y 1 2

(a) (￢p ∨ q ) ∧ (p ∨ ￢q) (b) (￢p ∨ q ) ∧ (q→ p)
(c) (￢p ∧ q ) ∨ (p ∧ ￢q) (d) (￢p ∧ ￢ q ) ∨ (p ∧ q)
(GATE 2015, 1 mark)
Let p, q, and r be propositions and the expression (p→q) →r be a contradiction. Then 1 K2 M Y 1 2

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
(GATE 2017, 2 mark)
The statement (￢p) → (￢q ) is logically equivalent to : 1 Y 1 2

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 (GATE 2017, 1 mark)
Consider the following two statements: 1 K3 H Y 1 6

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. (GATE2015,1)
Which one of the following well formed formula in predicate calculus is 1 K2 M Y 1 2

NOT valid?(a) (∀x p(x) →∀x q(x)) →(∃x ￢p(x) ∨ ∀x q(x)) (b) (∃x p(x)
∨∃x q(x)) →∃x (p(x) ∨ q(x)) (c) ∃x (p(x) ∧ q(x)) →(∃x p(x) ∧∃x q(x)) (d)
∀x( p(x) ∨ q(x)) →(∀x p(x) ∨ ∀x q(x)) (GATE 2016, 2 mark)
What is the logical translation of the following statements? “ None of my friends 1 K2 M Y 1 2

are perfect”
(a) ∃x(F(x) ∧￢P(x)) (b) ∃x(￢F(x) ∧ P(x))
(c) ∃x(￢F(x) ∧￢P(x)) (d) ￢∃x(F(x) ∧ P(x)) (GATE 2013, 2 mark)
Consider the statement:“ Not all that glitters is gold” 1 K2 M Y 1 2

Predicate glitters(x) is true if x glitters and predicate gold(x) is true if x is
gold.
Which one of the following logical formula represents the above
statement?
(a) ∀x:glitters(x) →￢gold(x) (b) ∀x: gold(x) → glitters(x)
(c) ∃x: gold(x) ∧￢glitters(x) (d) ∃x: glitters (x) ∧￢gold (x)
(GATE 2014, 1 mark)
Use De Morgan’s laws to find the negation of each of the following 1 K2 L N 1 6

statements. a) Jasbir is rich and happy b) Rajan will bicycle or run
tomorrow. (7/34/KR)
Show that each of these conditional statements is a tautology by using 1 K2 M 1 6

truth tables. (And then without using the truth tables.)
a) (p ∧ q) → p b) p → (p ∨ q) c) ￢p → (p → q) (9, 11/35/KR)
Show that (p → q) ∧ (q → r) → (p → r) is a tautology. (29/35/KR) 1 K2 M N 1 6
Show that two compound propositions are logically equivalent: 1 K2 L N 1 2

a) ￢(p ↔ q) and p ↔￢q b). ￢p ↔ q and p ↔￢q
c) ￢(p ↔ q) and ￢p ↔ q (17,19,21,23/35/KR)
Show that (p → q) → r and p → (q → r) are not logically equivalent. 1 K2 M N 1 6

(31/35/KR)
Determine whether each of these compound propositions is satisfiable. 1 K2 M N 1 6

a) (p ∨￢q) ∧ (￢p ∨ q) ∧ (￢p ∨￢q) b) (p → q) ∧ (p →￢q) ∧ (￢p
→ q) ∧ (￢p →￢q) c) (p ↔ q) ∧ (￢p ↔ q)
(61,62/36/KR)
Find the Disjunctive Normal Form (DNF) of (p ∨ q)→¬r. (31/35/KR) 1 K2 H N 1 6
Find the Disjunctive Normal Form (DNF) of p↔ (∼p ˅∼q). ). (Ex 1 K3 H N 1 6

4.27/4.25/SS)
Put the following into Conjunctive Normal form . 1 K3 H N 1 6

(42/35/KR)
Put the following into Conjunctive Normal form (p˅∼q)→q(Ex 4.27/4.25/SS) 1 K3 H N 1 6
Translate each of these statements into logical expressions using 1 K2 H N 1 6

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. (25/54/KR)
Find the argument form for the following argument and determine 1 K2 H N 1 6
whether it is valid. Can we conclude that the conclusion is true if the
premises are true?
If Socrates is human, then Socrates is mortal.
Socrates is human.
∴ Socrates is mortal. (1/78/KR)
1 K2 H N 1 6
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.
Use rules of inference to show that the hypotheses “Randy works 1 K2 M N 1 6
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.” (5/78/KR)
For each of these arguments, explain which rules of inference are used 1 K2 M N 1 6
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.”
Determine whether each of these arguments is valid. If an 1 K2 M N 1 6

argument is correct, what rule of inference is being used? If it is
not, what logical error occurs?
a) If n is a real number such that n > 1, then n2 > 1. Suppose that n2
> 1. Then n > 1.
b) If n is a real number with n > 3, then n2 > 9. Suppose that n2 ≤ 9.
Then n ≤ 3.
c) If n is a real number with n > 2, then n2 > 4. Suppose that n ≤ 2.
Then n2 ≤ 4. (19/79/KR)
Check the following systems for consistency: 1 K2 M N 1 6

a) p→q,p→r,q→∼r,p (b) p→(q→r),q→(r→s),p∧q∧∼s
Test the validity of the following argument: All integers are 1 K3 H N 1 9

irrational numbers.Some integers are powers of 2.Therefore,some
irrational number is a power of 2.
Test the validity of the following argument: It is not the case that if 1 K3 H N 1 9
the price of petrol goes up,then the demand for two wheelers goes
down. It is not true that either an alternative source of energy will
be invented or the income of Indian Railways will not
increase..Therfore the demand for two wheelers will not go down
and the income of Indian Railways will increase.
Prove that if n is an integer and 3n+2 is odd, then n is odd. 1 K2 M N 1 6

(Ex3/76/KR)
Give a direct proof of the theorem “If n is an odd integer, then n2 is 1 K2 M N 1 6

odd.” (Ex1/75/KR)
Give a proof by contradiction of the theorem “If 3n+2 is odd, then n is 1 K2 M N 1 6
odd”. (Ex11/79/KR)
Translate these statements into English, where C(x) is “x is a 1 K2 H N 1 2

comedian” and F(x) is “x is funny” and the domain consists of all
people.
a) ∀x(C(x) → F(x)) b) ∀x(C(x) ∧ F(x))
c) ∃x(C(x) → F(x)) d) ∃x(C(x) ∧ F(x)) (7/53/KR)

Practice Set Unit 1

Uploaded by

Copyright:

Available Formats

Practice Set Unit 1

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Practice Set Unit 1

Uploaded by

Copyright:

Available Formats

Question Bank-Unit 1

Determine whether these biconditionals are true or false. 1 K2 L N 1 2

Determine whether each of these conditional statements is true or false. 1 K2 L N 1 2

State the converse, contrapositive, and inverse of the conditional statements. 1 K2 L N 1 2

State the converse, contrapositive, and inverse of each of these conditional 1 K2 M N 1 6

Which one of the following is not equivalent to p↔q? 1 K2 M Y 1 2

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

The statement (￢p) → (￢q ) is logically equivalent to : 1 Y 1 2

Consider the following two statements: 1 K3 H Y 1 6

Which one of the following well formed formula in predicate calculus is 1 K2 M Y 1 2

What is the logical translation of the following statements? “ None of my friends 1 K2 M Y 1 2

Consider the statement:“ Not all that glitters is gold” 1 K2 M Y 1 2

Use De Morgan’s laws to find the negation of each of the following 1 K2 L N 1 6

Show that each of these conditional statements is a tautology by using 1 K2 M 1 6

Show that (p → q) ∧ (q → r) → (p → r) is a tautology. (29/35/KR) 1 K2 M N 1 6

Show that two compound propositions are logically equivalent: 1 K2 L N 1 2

Show that (p → q) → r and p → (q → r) are not logically equivalent. 1 K2 M N 1 6

Determine whether each of these compound propositions is satisfiable. 1 K2 M N 1 6

Find the Disjunctive Normal Form (DNF) of (p ∨ q)→¬r. (31/35/KR) 1 K2 H N 1 6

Find the Disjunctive Normal Form (DNF) of p↔ (∼p ˅∼q). ). (Ex 1 K3 H N 1 6

Put the following into Conjunctive Normal form . 1 K3 H N 1 6

Put the following into Conjunctive Normal form (p˅∼q)→q(Ex 4.27/4.25/SS) 1 K3 H N 1 6

Translate each of these statements into logical expressions using 1 K2 H N 1 6

Determine whether each of these arguments is valid. If an 1 K2 M N 1 6

Check the following systems for consistency: 1 K2 M N 1 6

Test the validity of the following argument: All integers are 1 K3 H N 1 9

Prove that if n is an integer and 3n+2 is odd, then n is odd. 1 K2 M N 1 6

Give a direct proof of the theorem “If n is an odd integer, then n2 is 1 K2 M N 1 6

Translate these statements into English, where C(x) is “x is a 1 K2 H N 1 2

You might also like