Scribd
Upload
58 views3 pages

Tut 5 - Solutions PDF

This document contains solutions to a tutorial on propositional logic and truth tables. It includes: 1) Three truth tables for logical statements involving connectives like negation, conjunction, and implication. 2) A statement that is valid because the premises are true only when the conclusion is also true. 3) Three pairs of logically equivalent statements shown through identical truth table columns. 4) Statements that are a tautology, a tautology, and a contradiction as determined by their truth tables.

Uploaded by

Darian Chetty
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
58 views3 pages

Tut 5 - Solutions PDF

This document contains solutions to a tutorial on propositional logic and truth tables. It includes: 1) Three truth tables for logical statements involving connectives like negation, conjunction, and implication. 2) A statement that is valid because the premises are true only when the conclusion is also true. 3) Three pairs of logically equivalent statements shown through identical truth table columns. 4) Statements that are a tautology, a tautology, and a contradiction as determined by their truth tables.

Uploaded by

Darian Chetty
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/ 3

COMP107 2021

Tutorial 5 – Solutions

Note that 1’s are interchangeable for T’s (True) and 0’s for F’s (False)

1. a.

𝒑 𝒒 ¬ 𝒒 (𝒑 ∧ ¬𝒒) (𝒑 ∧ ¬𝒒) → 𝒒
T T F F T
T F T T F
F T F F T
F F T F T

b.

𝒑 𝒒 𝒓 ¬ 𝒒 ¬ 𝒓 (𝒑 ∨ ¬ 𝒓) ¬ 𝒒 → (𝒑 ∨ ¬ 𝒓)
T T T F F T T
T T F F T T T
T F T T F T T
T F F T T T T
F T T F F F T
F T F F T T T
F F T T F F F
F F F T T T T

c.

𝒑 𝒒 𝒓 (𝒑 → 𝒒) (𝒒 ∧ 𝒓) ¬ (𝒒 ∧ 𝒓) (𝒑 → 𝒒) ↔ ¬ (𝒒 ∧ 𝒓)
T T T T T F F
T T F T F T T
T F T F F T F
T F F F F T F
F T T T T F F
F T F T F T T
F F T T F T T
F F F T F T T

1
COMP107 2021

2.

𝒑 𝒒 𝒓 ¬𝒓 𝒑 → 𝒒 𝒒 → ¬ 𝒓 ¬𝒑
T T T F T F F
T T F T T T F
T F T F F T F
T F F T F T F
F T T F T F T
F T F T T T T
F F T F T T T
F F F T T T T

There is only one row where all the premises are True in this complete truth table.
The argument is valid since when all the premises are True, the conclusion is also True.

3.
a.

𝒑 𝒒 ¬ 𝒒 (𝒑 ∧ ¬𝒒) ¬ 𝒑 (¬ 𝒑 ∧ 𝒒) (𝒑 ∧ ¬𝒒) ∨ (¬ 𝒑 ∧ 𝒒)
T T F F F F F
T F T T F F T
F T F F T T T
F F T F T F F

b.

𝒑 𝒒 (𝒑 ∨ 𝒒) (𝒑 ∧ 𝒒) ¬ (𝒑 ∧ 𝒒) (𝒑 ∨ 𝒒) ∧ (¬ (𝒑 ∧ 𝒒))
T T T T F F
T F T F T T
F T T F T T
F F F F T F

c.

𝒑 𝒒 (𝒑 ∧ 𝒒) ¬ 𝒑 ¬ 𝒒 (¬ 𝒑) ∧ (¬ 𝒒) (𝒑 ∧ 𝒒) ∨ ((¬ 𝒑) ∧ (¬ 𝒒)) ¬((𝒑 ∧ 𝒒) ∨ ((¬ 𝒑) ∧ (¬ 𝒒)))


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

Since the final columns of a), b) and c) are all identical - all three statements are logically equivalent.

2
COMP107 2021

4.
a.

𝒑 𝒒 (𝒑 ∧ 𝒒) ¬ (𝒑 ∧ 𝒒) (𝒑 ∧ 𝒒) ∨ (¬ (𝒑 ∧ 𝒒))
T T T F T
T F F T T
F T F T T
F F F T T

This is a tautology since the statement always evaluates to True.

b.

𝒑 𝒒 𝒓 (𝒑 ∧ 𝒒 ∧ 𝒓) ¬𝒓 (𝒑 ∧ 𝒒 ∧ (¬𝒓)) 𝒑 ∧ 𝒒 ¬ (𝒑 ∧ 𝒒) (𝒑 ∧ 𝒒 ∧ 𝒓) ∨ (𝒑 ∧ 𝒒 ∧ (¬ 𝒓)) ∨ (¬ (𝒑 ∧ 𝒒))


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

This is a tautology since the statement always evaluates to True.

c.

𝒑 𝒒 𝒓 (𝒑 ∨ 𝒒 ∨ 𝒓) ¬𝒓 𝒑 ∨ (¬𝒓) ¬𝒑 ¬𝒒 (𝒑 ∨ 𝒒 ∨ 𝒓) ∧ (𝒑 ∨ (¬ 𝒓)) ∧ (¬ 𝒑) ∧ (¬ 𝒒)
T T T T F T F F F
T T F T T T F F F
T F T T F T F T F
T F F T T T F T F
F T T T F F T F F
F T F T T T T F F
F F T T F F T T F
F F F F T T T T F

This is a contradiction since the statement always evaluates to False.

You might also like