Scribd
Upload
32 views4 pages

EECS 203: Discrete Mathematics Fall 2019 Discussion 1 Notes: 1 Definitions

This document contains notes for Discussion 1 of the EECS 203: Discrete Mathematics course. It includes definitions of key logical terms like proposition, converse, and tautology. It also lists 12 exercises involving evaluating logical statements for their truth values, expressing statements in propositional logic, using DeMorgan's laws, and determining logical equivalencies and satisfiability using truth tables. The exercises provide examples and practice applying concepts like logical connectives, conditional statements, negations, and consistency.

Uploaded by

sam
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
32 views4 pages

EECS 203: Discrete Mathematics Fall 2019 Discussion 1 Notes: 1 Definitions

This document contains notes for Discussion 1 of the EECS 203: Discrete Mathematics course. It includes definitions of key logical terms like proposition, converse, and tautology. It also lists 12 exercises involving evaluating logical statements for their truth values, expressing statements in propositional logic, using DeMorgan's laws, and determining logical equivalencies and satisfiability using truth tables. The exercises provide examples and practice applying concepts like logical connectives, conditional statements, negations, and consistency.

Uploaded by

sam
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/ 4

EECS 203: Discrete Mathematics

Fall 2019
Discussion 1 Notes
1 Definitions
• Proposition:

• Converse:

• Contrapositive:

• Inverse:

• Tautology:

• Contradiction:

• Satisfiable:

• Consistent System:

• Logically equivalent (≡):

2 Exercises
1. Exercise 1.1.2
Which of these are propositions? What are the truth values of those that are propositions?

a) Do not pass go.

b) What time is it?

c) There are no black flies in Maine.

d) 4 + x = 5

e) The moon is made of green cheese.

f) 2n ≥ 100

1
2. Conditional statement and English statement
Express the conditional statement p → q in the following form:

a) If , then .

b) only if .

c) unless .

d) whenever .

3. Exercise 1.1.17
Let p, q, and r be the propositions defined as follows.

• p: Grizzly bears have been seen in the area.

• q: Hiking is safe on the trail.

• r: Berries are ripe along the trail.

Write these propositions using p, q, and r and logical connectives (including negations).

a) Berries are ripe along the trail, but grizzly bears have not been seen in the area.

b) Grizzly bears have not been seen in the area and hiking on the trail is safe, but berries
are ripe along the trail.

c) If berries are ripe along the trail, hiking is safe if and only if grizzly bears have not been
seen in the area.

d) It is not safe to hike on the trail, but grizzly bears have not been seen in the area and
the berries along the trail are ripe

4. Exercise 1.1.29
State the converse, contrapositive, and inverse of each of these conditional statements.

a) If it snows today, I will ski tomorrow.

b) I come to class whenever there is going to be a quiz.

c) A positive integer is a prime only if it has no divisors other than 1 and itself.

2
5. Exercise 1.1.32 modified
For each compound proposition, find its truth value when p = T , q = F , r = F , s = F ,
t = T , u = F , and v = F

a) (q → ¬p) ∨ (¬p → ¬q)

b) (p ∨ ¬t) ∧ (p ∨ ¬s)

c) (p → r) ∨ (¬s → ¬t) ∨ (¬u → v)

d) (p ∧ r ∧ s) ∨ (q ∧ t) ∨ (r ∧ ¬t)

6. Exercise 1.1.34
Construct a truth table for each of these compound propositions.

a) p → ¬p

c) p ⊕ (p ∨ q)

d) (p ∧ q) → (p ∨ q)

7. Exercise 1.2.3
Translate the following statement into propositional logic: You can graduate only if you have
completed the requirements of your major and you do not owe money to the university and
you do not have an overdue library book. Express your answer in terms of:
g: you can graduate,
m: you owe money to the university,
r: you have completed the requirements of your major, and
b: you have an overdue library book.

8. Exercise 1.2.12
Are these system specifications consistent? If the file system is not locked, then new messages
will be queued. If the file system is not locked, then the system is functioning normally, and
conversely. If new messages are not queued, then they will be sent to the message buffer.
If the file system is not locked, then new messages will be sent to the message buffer. New
messages will not be sent to the message buffer.

3
9. Exercise 1.3.7
Use DeMorgan’s laws to find the negations of each of the following statements.
a) Jan is rich and happy.
b) Carlos will bicycle or run tomorrow.

10. Exercise 1.3.12 (a) modified


Show that each of these conditional statements is a tautology by using truth tables and by
using logical equivalencies.
a) [¬p ∧ (p ∨ q)] → q

11. Exercise 1.3.64


Show that the negation of an unsatisfiable compound proposition is a tautology and the
negation of a compound proposition that is a tautology is unsatisfiable.

12. Exercise 1.3.65


Determine whether each of these compound propositions is satisfiable.
a) (p ∨ ¬q) ∧ (¬p ∨ q) ∧ (¬p ∨ ¬q)
b) (p → q) ∧ (p → ¬q) ∧ (¬p → q) ∧ (¬p → ¬q)

You might also like