Scribd
Upload
4 views2 pages

Tutorial Conditional Statements

The document is a tutorial on conditional statements, covering various exercises including rewriting statements in if-then form, constructing truth tables, determining logical equivalence, and rewriting statements using logical equivalences. It also includes tasks related to negations, converses, and inverses of statements. The tutorial emphasizes understanding logical structures and relationships through practical examples.

Uploaded by

thandananimondli363
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
4 views2 pages

Tutorial Conditional Statements

The document is a tutorial on conditional statements, covering various exercises including rewriting statements in if-then form, constructing truth tables, determining logical equivalence, and rewriting statements using logical equivalences. It also includes tasks related to negations, converses, and inverses of statements. The tutorial emphasizes understanding logical structures and relationships through practical examples.

Uploaded by

thandananimondli363
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

Tutorial 1: (Conditional Statements)

1. Rewrite the statements below in if-then form:


a) This loop will repeat exactly 𝑁 time if it does not contain a stop or a
go to.
b) Freeze or I’ll shoot

2. Construct truth tables for the statements forms below:


a) ~𝑝⋁𝑞 →∼ 𝑞 b) 𝑝 ∧∼ 𝑞 → 𝑟 c) 𝑝 ∨∼ 𝑞 → 𝑟 d) 𝑝 ∨∼ 𝑟 ↔ 𝑞 ∨ 𝑟
e) (𝑝 → (𝑞 → 𝑟)) ↔ ((𝑝 ∧ 𝑞) → 𝑟)
3. Determine whether the following statement forms are logically
equivalent:
𝑝 → (𝑞 → 𝑟) and (𝑝 → 𝑞) → 𝑟

4. Write the following statements in symbolic form and determine whether


they are logically equivalent.
“If 2 is a factor of 𝑛 and is a factor of 𝑛, then 6 is a factor of 𝑛”
“2 is not a factor of 𝑛 or 3 is not a factor of 𝑛 or 6 is a factor of 𝑛.”

5. Is the following statement true or false? explain:


The negation of “If Sue is Luiz’s mother, then Ali is his cousin” is “If Sue is
Luiz’s mother, then Ali is not his cousin.”

6. Suppose 𝑝 and 𝑞 are statements so that 𝑝 → 𝑞 is false. Find the truth


values of each of the following:
a) 𝑝 →∼ 𝑞 b) 𝑞 → 𝑝

7. Write the converse and inverse for the following statement:


“If 𝑥 is nonnegative, then 𝑥 is positive or 𝑥 is 0.”

8. If 𝑃 ≡ 𝑄, then 𝑃 ↔ 𝑄 is a tautology. Conversely, if 𝑃 ↔ 𝑄 is a tautology,


the 𝑃 and 𝑄 are logically equivalent. Use ↔ to convert the following
logical equivalence to a tautology. Then use a truth table to verify that
tautology:
𝑝 → (𝑞 ∨ 𝑟) ≡ (𝑝 ∧∼ 𝑞) → 𝑟
9. Rewrite the following statement as a conjunction of two if-then
statements:
“This integer is even if, and only if, it equals twice some integer.”

10. Rewrite the statement below in if-then form in two ways, one of which
is the contrapositive of the other:
“Sam will be allowed on Signe’s racing boat only if he is an expert
sailor.”

11. Rewrite the following statements in if-then form:


a) Having 45∘ angles is a sufficient condition for this triangle to be a
right-angled triangle.
b) Doing homework regularly is a necessary condition for Jim to pass
the course.

12. It was proved in class that:


𝑝 → 𝑞 ≡∼ 𝑝 ∨ 𝑞 and 𝑝 ↔ 𝑞 ≡ (∼ 𝑝 ∨ 𝑞) ∧ (∼ 𝑞 ∨ 𝑝).
Use these logical equivalences to rewrite the following statements
without using → or ↔
a) (𝑝 → 𝑟) ↔ (𝑞 → 𝑟) b) (𝑝 → (𝑞 → 𝑟)) ↔ ((𝑝 ∧ 𝑞) → 𝑟)

13. It was proved in class that:


𝑝 ∨ 𝑞 ≡∼ (∼ 𝑝 ∧∼ 𝑞)
Use this logical equivalence to rewrite each statement form that
resulted from 12 (a) and (b) above in terms of ∧ and ∼ only.

You might also like