Scribd
Upload
7 views2 pages

Discrete Structure Tutor 1

This tutorial focuses on propositional logic, requiring students to solve various problems and submit their answers by a specified deadline. Objectives include reinforcing knowledge of propositional logic and providing practical problem-solving experience. The tutorial contains multiple questions involving propositions, symbolic representations, logical equivalences, De Morgan's laws, and truth tables.

Uploaded by

anthonyau95
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
7 views2 pages

Discrete Structure Tutor 1

This tutorial focuses on propositional logic, requiring students to solve various problems and submit their answers by a specified deadline. Objectives include reinforcing knowledge of propositional logic and providing practical problem-solving experience. The tutorial contains multiple questions involving propositions, symbolic representations, logical equivalences, De Morgan's laws, and truth tables.

Uploaded by

anthonyau95
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 04

Propositional Logic
Submission Details

In this tutorial, you are required to solve the given problems and turn in your answers using the given template
to SPEED office (located at HHB-807) on or before 11:30am, 19 October 2015 (Monday).

Objectives

The objectives of this tutorial are two-fold.


i. To reinforce what you have learned about propositional logic this week, and
ii. To provide you hands-on practice in solving conceptual and real world problems using propositional
logic.

Questions

1. Indicate which of the following sentences are propositions.


(a) 1,024 is the smallest four-digit number that is a perfect square.
(b) She is a mathematics major.
(c) 128 = 26
(d) x = 26

2. Let h = “John is healthy” and w = “John is wealthy”, and s = “John is wise”.


Write the following statements in symbolic form using the logical connectors,∼, ∧, and ∨, and indicated
letters.
(a) John is healthy and wealthy but not wise.
(b) John is not wealthy but he is healthy and wise.
(c) John is neither healthy, wealthy, nor wise.
(d) John is neither wealthy nor wise, but he is healthy.
(e) John is wealth, but he is not both healthy and wise.

3. Determine whether the following statements are logically equivalent. In each case, construct a truth table
and include a sentence justifying your answer.
(a) p ∧ (q ∧ r) and (p ∧ q) ∨ (p ∧ r)
(b) (p∨ q) ∨ (p ∧ r) and (p ∨ q) ∧ r

School of Professional Education and Executive Development (SPEED), 1


College of Professional and Continuing Education (CPCE), The Hong Kong Polytechnic University
4. Use De Morgan’s laws to write negations for the following statements.
(a) The train is late or my watch is fast.
(b) Tim is a math major and Tim’s sister is a computer science major.

5. Use truth tables to establish which of the following statements are tautologies and which are
contradictions.
(a) (p ∧ q) ∨ (∼ p ∨ (q ∧∼ q))
(b) (p ∧∼ q) ∧ (∼ p ∨ q)
(c) ((∼ p ∧ q) ∧ (q ∧ r)) ∧∼ q
(d) (∼ p ∨ q) ∨ (p ∧∼ q)

6. Show (p ∧∼ q) ∨ (p ∧ q) ≡ p algebraically.

7. Write each of the following three statements in symbolic form and determine which pairs are logically
equivalent. Include truth tables and a few words of explanation.
(a) If it walks like a duck and it talks like a duck, then it is a duck.
(b) Either it does not walk like a duck or it does not talk like a duck, or it is a duck.
(c) If it does not walk like a duck and it does not talk like a duck, then it is not a duck.

8. Write negations for each of the following statements. (Assume that all variables represent fixed
quantities or entities, as appropriate.)
(a) If P is a square, then P is a rectangle.
(b) If today is New Year’s Eve, then tomorrow is January.
(c) If Tom is Ann’s father, then Jim is her uncle and Sue is her aunt.

9. Use the logical equivalences p → q ≡ ~p ∨ q and p ↔ q ≡ (∼ p ∨ q) ∧ (∼ q ∨ p) to rewrite the


given statement forms with using the symbol → or ↔, and use the logical equivalence p ∨ q ≡∼ (∼
p ∧∼ q) to write each statement form using only ∧ and ∼.
(a) p ∧∼ q → r
(b) p ∨∼ q → r ∨ q
(c) (p → r) ↔ (q → r)
(d) (p → (q → r)) ↔ ((p ∧ q) → r)

School of Professional Education and Executive Development (SPEED), 2


College of Professional and Continuing Education (CPCE), The Hong Kong Polytechnic University

You might also like