Scribd
Upload
3 views2 pages

Tutorial 02

The document outlines a tutorial on propositional logic, including exercises on logical equivalences, conditional statements, and logical inference. It requires students to prove equivalences between expressions, construct converses and contrapositives for given statements, and validate arguments using inference rules. The tutorial is divided into sections for submission and non-submission tasks.

Uploaded by

eas428.shan
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
3 views2 pages

Tutorial 02

The document outlines a tutorial on propositional logic, including exercises on logical equivalences, conditional statements, and logical inference. It requires students to prove equivalences between expressions, construct converses and contrapositives for given statements, and validate arguments using inference rules. The tutorial is divided into sections for submission and non-submission tasks.

Uploaded by

eas428.shan
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

CSC/MAT A67 Tutorial 2 — Propositional Logic Continued

1 logical equivalences (to be submitted)


For each pair of expressions, prove that the two are equivalent.
1. ¬(a ∧ b) ∨ c and ¬a ∨ ¬(b ∧ ¬c)
2. ¬A ∧ ¬(B ∧ C) and ¬(A ∨ B) ∨ ¬(A ∨ C)
Show that the following pairs of expressions are not equivalent:
1. a → b and ¬a → ¬b
2. (a → b) ∧ (b → c) and (a ∧ b) → c

2 conditional statements (not to be submitted)


A few ways of expressing P → Q in mathematics:
• P implies Q.
• if P then Q.
• Q, if P .
• P is a sufficient condition for Q.
• Q is a necessary condition for P .
Provide logical forms of the following statements.

Construct a converse and a contrapositive for each conditional statement: provide your answers
both as logical expressions and English sentences.
Let A be “Alice is at the party”, B be “Bob is at the party”, C be “Charlie is at the party”,
and D is “David is at the party”.
1. If Alice is at the party, then so is Bob.
2. Charlie is at the party, only if both Alice and Bob are.
3. David is not at the party, if Alice is.
4. If Bob is not at the party, then Alice is.
5. If Bob is not at the party, then neither is Alice.
6. Neither Alice nor Bob being at the party is a sufficient condition for Charlie to be at the party.
7. Both Alice and Bob being at the party is a necessary condition for Charlie to be at the party.

3 logical equivalences (to be submitted)


For each pair of expressions, either prove that the two are equivalent or prove that they are not.
1. ¬(a → b) and ¬a ∧ b
2. ¬(a → b) and a ∧ ¬b
3. a ↔ ¬b and (a ∧ ¬b) ∨ (¬a ∧ b)

1
4 logical inference (to be submitted)
Use the rules of inference from class, to prove validity of the following arguments. The suggested
propositional variables are listed in brackets in the statements. Use one of the two formats shown
in class.

1. If I play hockey (H), then I am sore the next day (S). I use the whirlpool (W) if I am sore. I
did not use the whirlpool. Therefore, I did not play hockey.
2. I am either dreaming (D) or hallucinating (H). I am not dreaming. If I am hallucinating, I see
elephants running down the road (E). Therefore, I see elephants running down the road.

3. If I go running (R), I stay in the sun for too long (S). If I go swimming (W), I stay in the
sun for too long. If I stay in the sun for too long, I get sunburn (B). I did not get a sunburn.
Therefore, I neither went running nor swimming.

You might also like