Scribd
Upload
23 views5 pages

For Both Your Sentences (Original

1. The document provides an example of using logical connectives and symbols to represent a conditional statement. A truth table is used to prove the equivalence of the original statement and one rewritten using De Morgan's laws. 2. Another example statement is represented symbolically and a truth table shows its equivalence to a statement rewritten using logical equivalences. 3. A multi-part conditional statement is rewritten without using implication or biconditional symbols by applying logical equivalences and proved equivalent using a conjunction of disjunctions.

Uploaded by

FELIX KIPRONO
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
23 views5 pages

For Both Your Sentences (Original

1. The document provides an example of using logical connectives and symbols to represent a conditional statement. A truth table is used to prove the equivalence of the original statement and one rewritten using De Morgan's laws. 2. Another example statement is represented symbolically and a truth table shows its equivalence to a statement rewritten using logical equivalences. 3. A multi-part conditional statement is rewritten without using implication or biconditional symbols by applying logical equivalences and proved equivalent using a conjunction of disjunctions.

Uploaded by

FELIX KIPRONO
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/ 5

1.

Generate your own example of statement using “and/or” by


connecting two sentences, then re-state your sentences by
applying De Morgan’s law. In addition, write your statement
using the symbols ~, ∨, ∧ for both your sentences (original
one and re-stated one) and prove that they are equivalent by
using truth tables.

If I wake up late or it is raining, then I do not catch the bus and I


will not sit for exam.
Let “I wake up late” be P
Let “it is raining” be Q
Let “I do not catch the bus” be R
Let “I will not sit for exam” be S
The sentence will translate to:
(P ∨ Q) → (R ∧ S)

If the statement P → Q can be rewritten as ~P ∨ Q, then the


statement (P ∨ Q) → (R ∧ S) can be rewritten as;
~ (P ∨ Q) ∨ (R ∧ S)

~ (P ∨ Q) ∨ (R ∧ S) = (~P ∧ ~Q) ∨ (R ∧ S)
TRUTH TABLE FOR (P ∨ Q) → (R ∧ S)
P Q R S (P ∨ Q) (R ∧ S) (P ∨ Q) → (R ∧ S)
Fals False False False False False True
e
Fals False False True False True True
e
Fals False True False False True True
e
Fals False True True False True True
e
Fals True False False True False False
e
Fals True False True True True False
e
Fals True True False True True False
e
Fals True True True True True True
e
True False False False True False False
True False False True True True False
True False True False True True False
True False True True True True True
True True False False True False False
True True False True True True False
True True True False True True False
True True True True True True True
TRUTH TABLE FOR (~P ∧ ~Q) ∨ (R ∧ S)
P Q R S (~P ∧ ~Q) (R ∧ S) (~P ∧ ~Q) ∨ (R ∧ S)
Fals False Fals False False False True
e e
Fals False Fals True False True True
e e
Fals False True False False True True
e
Fals False True True False True True
e
Fals True Fals False True False False
e e
Fals True Fals True True True False
e e
Fals True True False True True False
e
Fals True True True True True True
e
True False Fals False True False False
e
True False Fals True True True False
e
True False True False True True False
True False True True True True True
True True Fals False True False False
e
True True Fals True True True False
e
True True True False True True False
True True True True True True True

2. “If compound X is boiling, then its temperature must be at


least 1500 C” Assuming that this statement is true, generate
equivalent sentence using logical equivalences. Write your
statement using the symbols ~, ∨, ∧, and → for both your
sentences (original one and re-stated one) and prove that
they are equivalent by using truth tables.

The statement “If compound X is boiling, then its temperature


must be at least 1500 C” can be written symbolically as follows;
Let “compound X is boiling” be P
Let “its temperature must be at least 1500 C” be Q
Therefore, the statement is:
P→Q
This statement can also be stated as ““Compound X is not boiling
or its temperature must be at least 1500 C”
Symbolically, this can be can be represented as:
~P ∨ Q

TRUTH TABLE FOR (P → Q)

P Q P→Q
False False True
False True True
True False False
True True True
TRUTH TABLE FOR (~P ∨ Q)

P Q ~P (~P ∨ Q)
False False True True
False True True True
True False False False
True True False True

3. Use the logical equivalences:


p → q ≡~ p ∨ q and p ↔ q ≡ (~p ∨ q) ∧ (~q ∨ p) to rewrite the statement form
without using the symbol → or ↔
1st part:
(p → (q → r)) ↔ ((p ∧ q) → r)
(q → r) ≡ ~ q ∨ r
(p → (q → r)) ≡ (p → (~ q ∨ r))
(p → (~ q ∨ r)) ≡ ~ p ∨ (~ q ∨ r)
2nd part:
((p ∧ q) → r) ≡ ~ (p ∧ q) ∨ r
Hence;
~ p ∨ (~ q ∨ r) ↔ ~ (p ∧ q) ∨ r but p ↔ q ≡ (~p ∨ q) ∧ (~q ∨ p)
~ p ∨ (~ q ∨ r) ↔ ~ (p ∧ q) ∨ r ≡ ~ [~ p ∨ (~ q ∨ r)] ∨ [~ (p ∧ q) ∨ r] ∧ ~[~ (p ∧ q) ∨ r] ∨
[~ p ∨ (~ q ∨ r)]
≡ p ∧ q ∧ ~r ∨ ~ p ∨ ~q ∨ r ∧ p ∧ q ∧ ~r ∨ ~ p ∨ ~ q ∨ r

You might also like