Scribd
Upload
886 views2 pages

Quiz - Unit 1.4

1. The document discusses simplifying propositional logic statements using equivalence rules. It provides an example to simplify ((P ∧ Q) ∨ Q) ∧ ((P ∧ Q) ∨ P) using distribution and other rules. 2. Truth tables are used to determine if two propositions are equivalent: ¬((P ∨ Q) ∧ (¬P)) and ¬(P → Q). They are not equivalent. 3. Another set of propositions are tested for equivalence using truth tables: ((¬P) ∨ (¬Q)) → R and (R ∧ P) ∨ (¬Q). These are also not equivalent.

Uploaded by

Yonatan Kesselman
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
886 views2 pages

Quiz - Unit 1.4

1. The document discusses simplifying propositional logic statements using equivalence rules. It provides an example to simplify ((P ∧ Q) ∨ Q) ∧ ((P ∧ Q) ∨ P) using distribution and other rules. 2. Truth tables are used to determine if two propositions are equivalent: ¬((P ∨ Q) ∧ (¬P)) and ¬(P → Q). They are not equivalent. 3. Another set of propositions are tested for equivalence using truth tables: ((¬P) ∨ (¬Q)) → R and (R ∧ P) ∨ (¬Q). These are also not equivalent.

Uploaded by

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

Discrete Mathematics

Unit 1.4 – Equivalence

1. Use Distributivity and the rest of the equivalencies learned in class to simplify the
following proposition :

((𝑃 ∧ 𝑄) ∨ 𝑄) ∧ ((𝑃 ∧ 𝑄) ∨ 𝑃)

In addition to the equivalencies learned in class you can also use the following :

𝑃∨ 𝑃 = 𝑃 ∧𝑃 = 𝑃

2. Use a truth table to determine whether the following propositions are equivalent:
1) ¬((𝑃 ∨ 𝑄) ∧ (¬𝑃))
2) ¬(𝑃 → 𝑄)
3. Use a truth table to determine whether the following propositions are equivalent:
1) ((¬𝑃) ∨ (¬𝑄)) → 𝑅
2) (𝑅 ∧ 𝑃) ∨ (¬𝑄)

-1-
Answers

1. ((𝑃 ∧ 𝑄) ∨ 𝑄) ∧ ((𝑃 ∧ 𝑄) ∨ 𝑃) = (𝑃 ∧ 𝑄) ∨ (𝑃 ∧ 𝑄) = 𝑃 ∧ 𝑄
2.

(𝑷 ∨ 𝑸) ¬((𝑷 ∨ 𝑸) ¬(𝑷
P Q ¬𝑷 𝑷∨𝑸 𝑷→𝑸
∧ (¬𝑷) ∧ (¬𝑷)) → 𝑸)

T T F T F T T F

T F F T F T F T

F T T T T F T F

F F T F F T T F

The truth tables for these two propositions are not the same, therefore these
propositions are not equivalent.

3.

(𝑹 ∧ 𝑷) (¬𝑷 (¬𝑷 ∨ ¬𝑸)


P Q R 𝐑∧𝐏 ¬𝑸 ¬𝑷
∨ (¬𝑸) ∨ ¬𝑸) →𝑹

T T T T F T F F T

T T F F F F F F T

T F T T T T F T T

T F F F T T F T F

F T T F F F T T T

F T F F F F T T F

F F T F T T T T T

F F F F T T T T F

The truth tables for these two propositions are not the same, therefore these
propositions are not equivalent.

-2-

You might also like