Scribd
Upload
12 views

MTH202_BC230409427

The document presents a series of logical proofs and truth tables demonstrating various logical equivalences in discrete mathematics. It proves that p ∧ q is equivalent to (p → q), shows that (p → q) ∧ (q → p) is equivalent to p ↔ q, and establishes that ~(p ∨ ~(p ∧ q)) is a contradiction. Additionally, it confirms that (P → Q) ∨ (Q → P) is a tautology through a truth table analysis.

Uploaded by

W Sagher
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
12 views

MTH202_BC230409427

The document presents a series of logical proofs and truth tables demonstrating various logical equivalences in discrete mathematics. It proves that p ∧ q is equivalent to (p → q), shows that (p → q) ∧ (q → p) is equivalent to p ↔ q, and establishes that ~(p ∨ ~(p ∧ q)) is a contradiction. Additionally, it confirms that (P → Q) ∨ (Q → P) is a tautology through a truth table analysis.

Uploaded by

W Sagher
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Discrete

Mathematics
MTH202
Assignment No. 1

Submitted by:
BC230409427
Waleed Sagher
Q1: prove the following logical equivalence through truth table:
p ∧q ≡ ( p → q)

p q p∧q ~q p→~q ( p → q)
T T T F F T
T F F T T F
F T F F T F
F F F T T F
As the truth values for p∧q and ( p → q) are the same so both statements are logically
equivalent

Q2: show that (p→q)∧(q→p) are logically equivalent to p↔q


p→q is true if p is false and q is true
q→p is true if q is false and p is true
Truth table for all the statements will elaborate the perspective of their logical equivalence

p q p→q q→p (p→q)∧(q→p) p↔q


T T T T T T
T F F T F F
F T T F F F
F F T T T T

As it is obvious from the truth table that (p→q)∧(q→p) and p↔q are logically equivalent

Q3: Use the logical equivalence (p→q)∧(q→p) to prove that ~(p∨~(p∧q)) is a contradiction

De Morgan's Law states that ~(p ∨ q) is equivalent to ~p ∧ ~q. Applying this to the outer
negation, we get:
~(p ∨~(p∧q)) = ~p∧ ~ ~(p∧q)
The double negation law states that ~~p is equivalent to p. Applying this to the second part, we
get:

~p∧~~(p∧q) = ~p∧ (p∧q)

The distributive law states that p∧ (q ∨r) is equivalent to (p∧q) ∨ (p∧r). Applying this to the
expression, we get:

~p∧ (p∧q) = (~p∧p) ∧q

The expression ~p∧p is a contradiction because p and ~p cannot both be true at the same time.
Therefore, the entire expression (~p^p) ^ q is also a contradiction.

Q4: Show that (P → Q) ∨ (Q → P) is a tautology.


The above statement reads as “if P implies Q or if Q implies P” to confirm the tautology lets
build the truth table for the statement to see if it is always true or not:

P Q P→Q Q→P (P → Q) ∨ (Q → P)

T T T T T

T F F T T

F T T F T

F F T T T

As it is evident from the truth table that (P → Q) ∨ (Q → P) will alway be true for every
possible value P → Q andQ → P so it is a tautology

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy