Scribd
Upload
2 views

Logical-Equivalence

Reasoning of mathematics

Uploaded by

sanico724
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
2 views

Logical-Equivalence

Reasoning of mathematics

Uploaded by

sanico724
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Logical Equivalence

Definition:
A tautology is a proposition that is always true, regardless of the truth values of
the propositional variables it contains.

Definition:
A proposition that is always false is called a contradiction.

A proposition that is neither a tautology nor a contradiction is called a contingency.

𝑷 ~𝑷 𝑷 ∨ ~𝑷 P ∧ ~𝐏
T F T F
F T T F

Show that (𝑃 → Q) ↔ (~Q → ~P) is a tautology.

~
𝑷 𝑸 𝑷→𝐐 ~𝑸 ~𝐏 ~𝐐 → ~𝐏 (𝑷 → 𝐐) ↔ (~𝐐 → ~𝐏)
T T T F F T T
T F F T F F T
F T T F T T T
F F T T T T T
Hence, (𝑃 → 𝑄) ↔ (~𝑄 → ~P) is a tautology.

Show that [(𝑷 ∧ 𝑸) → 𝑹] → [~𝐑 → (~𝑷 ∨ ~𝑸)] is a tautology. (Exercise)

Question: If there are four propositional variables in a proposition, how many rows are there in
the truth table?

Definition:
Two logical formulas P and Q are said to be logically equivalent, denoted by
~ truth values in all cases.
𝑷 ≡ 𝑸, if P and Q have identical

Show that 𝑃 ↔ Q ≡ (P → Q) ∧ (𝑄 → P) using truth table.

𝑷 𝑸 𝑷↔𝐐 𝐏→𝐐 𝐐→𝐏 (𝐏 → 𝐐) ∧ (𝑸 → 𝐏)


T T T T T T
T F F F T F
F T F T F F
F F T T T T
Hence, 𝑃 ↔ 𝑄 and (𝑃 → 𝑄) ∧ (𝑄 → P) are logically equivalent.

Two logical formulas P and Q are logically equivalent, denoted by 𝑷 ≡ 𝑸, if and only if
𝑷 ↔ 𝑸 is a tautology.

Use truth tables to verify the following equivalent statements. (Exercise)


• and
𝐏→ q 𝐐 ≡ ~𝐏 ∨ 𝐐
• 𝐏 ∧ (𝐐 ∨ 𝐑) ≡ (𝐏 ∧ 𝐐) ∨ (𝐏 ∧ 𝐑)
are logically equivalent, denoted p≡q,
Laws of Logical Equivalence
Denote by T and F a tautology and a contradiction, respectively. We have the following properties for any
propositional variables P, Q, and R.

Logical Equivalences involving


Conditional Statements

Logical Equivalences involving


Biconditional Statements

Definition:
If 𝑃 → Q is a conditional, then the corresponding conditional ~Q → ~P is
called contrapositive, Q → P is called its converse, and ~P → ~Q is called its inverse.

Prove (𝑃 → Q) ≡ (~Q → ~P) using LQ.

(~𝑄 → ~P) ≡ ~(~𝑄) ∨ (~P) conditional


≡ 𝑄 ∨ (~P) double negation
≡ ~P ∨ Q commutative
(~𝑄 → ~P) ≡ 𝑃 → Q

Prove ~[𝑃 ∨ (~𝑃 ∧ Q) ≡ ~P ∧ ~𝑄 using LQ.


Prove that [~P ∧ (P ∨ Q)] → Q is a tautology.

Prove that [(𝑃 → 𝑄) ∧ (𝑄 → 𝑅)] → [𝑃 → 𝑅] is a tautology using LQ and truth table. (Exercise)

You might also like