Scribd
Upload
54 views

Tutorial 1 PDF

This document provides examples and problems related to symbolic logic and discrete structures. It covers writing statements in symbolic form, constructing truth tables, determining logical equivalence, using De Morgan's laws, logical equivalence theorems, contrapositives, and valid argument forms. The document is a tutorial that introduces these concepts and provides practice applying them.

Uploaded by

Pujan Thapa
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
54 views

Tutorial 1 PDF

This document provides examples and problems related to symbolic logic and discrete structures. It covers writing statements in symbolic form, constructing truth tables, determining logical equivalence, using De Morgan's laws, logical equivalence theorems, contrapositives, and valid argument forms. The document is a tutorial that introduces these concepts and provides practice applying them.

Uploaded by

Pujan Thapa
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

DISCRETE STRUCTURES

(ITS 66204)

TUTORIAL 1

1. Write the statement below in symbolic form using the symbols ~, ∨ and
∧ and the indicated letters to represent component statements.
a) Juan is a math major but not a computer science major. (m=“Juan is a math
major”, c=“Juan is a computer science major”)
b) Let h=“John is healthy”, w=“John is wealthy”, and s=“John is wise”.
i. John is healthy and wealthy but not wise.
ii. John is not wealthy but he is healthy and wise.
iii. John is neither healthy, wealthy, nor wise.
iv. John is neither wealthy nor wise, but he is healthy.
v. John is wealthy, but he is not both healthy and wise.
c) Either this polynomial has degree 2 or it has degree 3 but not both. (n=“This
polynomial has degree 2”, k=“This polynomial has degree 3”)

2. Write truth tables for statements below:


a) ∼ p ∧ q
b) p ∧ (q ∧ r)
c) ∼ (p ∧ q) ∨ (p ∨ q)
d) p ∧ (∼ q ∨ r)

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

4. Use De Morgan’s laws to write negations for the statements below:


a) Hal is a math major and Hal’s sister is a computer science major.
b) The train is late or my watch is fast.
c) The connector is loose or the machine is unplugged.
d) This computer program has a logical error in the first ten lines or it is being
run with an incomplete data set.
e) Sam is an orange belt and Kate is a red belt.

1
5. Use Logical Equivalence Theorem to verify the logical equivalences below.
a) (p∧ ∼ q) ∨ p ≡ p
b) ∼ (p∨ ∼ q) ∨ (∼ p∧ ∼ q) ≡∼ p

6. 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, the P is a rectangle.
b) If today is New Year’s Eve, the tomorrow is January.
c) if the decimal expansion of r is terminating, then r is rational.
d) If n is prime, then n is odd or n is 2.

7. Rewrite the statements below in if-then form.


a) Catching the 8:05 bus is a sufficient condition for my being on time for work.
b) Having two 45◦ angle is sufficient condition for this triangle to be a right tri-
angle.

8. Use the contrapositive to rewrite the the statements below in the if-then form in
two ways.
a) Being divisible by 3 is necessary condition for this number to be divisible by
9.
b) Doing homework regularly is a necessary condition for Jim to pass the course.

9. Use the logical equivalences p → q ≡∼ p ∨ q to rewrite the given statement froms


without using the symbol →and, use the logical equivalence p ∨ q ≡∼ (∼ p∧ ∼ q)
to rewrite each statement for using only ∧and ∼.
a) p∧ ∼ q → r
b) p∨ ∼ q → r ∨ q

10. Use truth table to determine whether the argument forms below are valid. Indicate
which columns represent the premises and which represent the conclusion.
a) p → q
q→p
∴ p∨q
b) p ∨ q
p →∼ q
p→r
∴ r

2
11. A set of premises and a conclusion are given below. Use the valid arguments
forms to deduce the conclusion from the premises, giving a reason for each step.
Assume all variables are statement variables.
a) p ∨ q
q→r
p∧s→t
∼r
∼q →u∧s
∴ t
b) ∼ p ∨ q → r
s∨ ∼ q
∼t
p→t
∼ p ∧ r →∼ s
∴∼ q

You might also like