English

Consider the following statements. If D is dog, then D is very good. If D is very good, then D is dog. If D is not very good, then D is not a dog.

Advertisements
Advertisements

Question

Consider the following statements.

  1. If D is dog, then D is very good.
  2. If D is very good, then D is dog.
  3. If D is not very good, then D is not a dog.
  4. If D is not a dog, then D is not very good. 

Identify the pairs of statements having the same meaning. Justify.

Sum
Advertisements

Solution

Let p : D is dog.
q : D is very good.
Then the given statement in the symbolic form is

  1. p → q
  2. q → p
  3. ~q → ~p
  4. ~p → ~q
p q ~p ~q p → q q → p ~q → ~p ~p → ~q
T T F F T T T T
T F F T F T F T
F T T F T F T F
F F T T T T T T

Since the entries in (i) and (iii) columns are the same, they have the same meaning.

Also, the entries in (ii) and (iv) columns are the same. they have the same meaning.

shaalaa.com
  Is there an error in this question or solution?
Chapter 1: Mathematical Logic - Miscellaneous Exercise 1 [Page 33]

APPEARS IN

Balbharati Mathematics and Statistics 1 (Commerce) [English] Standard 12 Maharashtra State Board
Chapter 1 Mathematical Logic
Miscellaneous Exercise 1 | Q 4.19 | Page 33

Video TutorialsVIEW ALL [2]

RELATED QUESTIONS

Using truth table prove that ∼p ˄ q ≡ (p ˅ q) ˄ ∼p


Using truth table, prove that ~ p ∧ q ≡ (p ∨ q) ∧ ~ p


Write the following compound statement symbolically.

x is not irrational number but is a square of an integer.


Construct the truth table of the following statement pattern.

(∼ p → ∼ q) ∧ (∼ q → ∼ p)


Construct the truth table of the following statement pattern.

(q → p) ∨ (∼ p ↔ q)


Construct the truth table of the following statement pattern.

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


Determine the truth values of p and q in the following case:

(p ∨ q) is T and (p ∨ q) → q is F


Express the following statement in symbolic form.

e is a vowel or 2 + 3 = 5


Express the following statement in symbolic form.

I like playing but not singing.


Write the following statement in symbolic form.

If triangle is equilateral then it is equiangular.


Write the following statement in symbolic form.

It is not true that “i” is a real number.


Find the truth value of the following statement.

If a joint venture is a temporary partnership, then discount on purchase is credited to the supplier.


Assuming that the following statement is true,

p : Sunday is holiday,

q : Ram does not study on holiday,

find the truth values of the following statements.

Sunday is not holiday or Ram studies on holiday.


Assuming the first statement p and second as q. Write the following statement in symbolic form.

It is not true that intelligent persons are neither polite nor helpful.


If p : Proof is lengthy.
q : It is interesting.
Express the following statement in symbolic form.

Proof is lengthy and it is not interesting.


Rewrite the following statement without using the connective ‘If ... then’.

If 10 − 3 = 7 then 10 × 3 ≠ 30.


Write the negation of the following statement.

I will have tea or coffee.


Find the negation of 10 + 20 = 30


Without using truth table show that -

(p ˅ q) ˄ (∼p v ∼q) ≡ (p ∧ ∼q) ˄ (∼p ∧ q)


Choose the correct alternative:

Negation of p → (p ˅ ~q) is


Write the negation of the statement “An angle is a right angle if and only if it is of measure 90°”


Given 'p' and 'q' as true and 'r' as false, the truth values of p v (q ∧ ~r) and (p → r) ∧ q are respectively


The symbolic form of the following circuit is (where p, q represents switches S1 and S2 closed respectively)


The negation of (p ∨ ∼q) ∧ q is ______


Conditional of p → q is equivalent to p → ∼ q.


Let p, q and r be any three logical statements. Which of the following is true?


From the following set of statements, select two statements which have similar meaning.

  1. If a man is judge, then he is honest.
  2. If a man is not a judge, then he is not honest.
  3. If a man is honest, then he is a judge.
  4. If a man is not honest, then he is not a judge.

Using truth table prove that:

~ (p `leftrightarrow` q) ≡ (p ∧ ~ q) ∨ (q ∧ ~ p)


Construct the truth table for the statement pattern:

[(p → q) ∧ q] → p


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×