Scribd
Upload
363 views15 pages

Discrete Math

The document discusses several key concepts in propositional logic: 1) De Morgan's Laws and how to use them to find the negation of statements involving conjunctions and disjunctions. 2) Predicates and quantifiers, including examples of domain, predicates, and quantified statements. 3) How to translate statements into logical expressions using predicates, quantifiers and connectives. 4) Examples of nested quantifiers and how to express statements using universal and existential quantifiers. 5) Several rules of inference like modus ponens, modus tollens, hypothetical syllogism and their applications in arguments.

Uploaded by

Jax Lucas
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
363 views15 pages

Discrete Math

The document discusses several key concepts in propositional logic: 1) De Morgan's Laws and how to use them to find the negation of statements involving conjunctions and disjunctions. 2) Predicates and quantifiers, including examples of domain, predicates, and quantified statements. 3) How to translate statements into logical expressions using predicates, quantifiers and connectives. 4) Examples of nested quantifiers and how to express statements using universal and existential quantifiers. 5) Several rules of inference like modus ponens, modus tollens, hypothetical syllogism and their applications in arguments.

Uploaded by

Jax Lucas
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/ 15

Propositional Equivalences

• De Morgan’s Law
• The rules can be expressed in English as:

• the negation of a disjunction is the conjunction of the negations; and


• the negation of a conjunction is the disjunction of the negations;
Use De Morgan’s Law to find the negation of
each of the following statement
John is rich and happy
John is not rich, or not happy
Carlos will bicycle or run tomorrow
Carlos will not bicycle tomorrow and Carlos will not run tomorrow
Mei walks or takes the bus to class
Mei will not walk to class and Mei does not take the bus to class
Ibrahim is smart and hardworking.
Ibrahim is not smart or Ibrahim is not hardworking
Predicates and Quantifiers

• Let P(x) denotes the statement “x<=4”. What are the truth values of
the following.
1. P(0)
2. P(4)
3. P(6)
4. P(5)
Let P(x) be the statement: x spends more than five hours every weekday
in class. Where the domain for x consist of All Students.
∃x P(x)
There is a student who spends more than 5 hours every weekday in
class.
∀x P(x)
Every Student spends more than 5 hours every weekday in class.
∃x ~P(x)
There is a student who does not spends more than 5 hours every
weekday in class.
∀x ~ P(x)
No students spends more than 5 hours every weekday in class.
Translate each of the statement into logical expressions
using predicates, quantifiers, and logical connectives.
Let P(x)=x is perfect. Let F(x) x is your friend, domain: all people
No one is perfect
∀x ~P(x)
Not everyone is perfect
~∀x P(x)
All your friends are perfect
∀x (F(x) -> P(x))
At least one of your friend is perfect
∃ x (F(x) -> P(x))
Nested Quantifier
• Let L(x,y) be the statement “x loves y” where the domain for both x and y consist
of all people in the world. Use quantifiers to express each of there statements.
• Everybody loves Jerry
• ∀x L(x,Jerry)
• Everybody loves somebody
• ∀x ∃y L(x,y)
• There is somebody where everybody loves
• ∃y ∀x L(x,y)
• Nobody loves everybody.
• ∀x ∃y ~L(x,y)
• There is somebody whom Lydia does not love.
• ∃x ~L(Lydia,y)
Rules of Inference
• What Rule of Inference is used in each of these arguments?
• Alice is a mathematics major. Therefore, Alice is either a mathematics major
or a computer science major.
• p=Alice is a mathematics major .
• q=Alice is a computer science major

p
.: pvq

Addition
Jerry is a mathematics major and a computer science major. Therefore, Jerry is
a mathematics major.

pq
p

Simplification
• If it is rainy, then the pool will be closed. It is rainy. Therefore, the pool is
closed.

pq
p
q

Rule of modus ponens


• If it snows today, the university will close. The university is not closed today.
Therefore, it did not snow today.

pq
q
 p

• Rule of modus tollens


• If I go swimming, then I will stay in the sun too long. If I stay in the sun too
long, then I will sunburn. Therefore, if I go swimming then I will sunburn.

p->q
q->r
.:p->r

• Hypothetical Syllogism
Conjunction

• If p and q are two premises, we can use Conjunction rule to derive


p∧q.
p
q
∴P∧Q
Let P − “He studies very hard”
Let Q − “He is the best boy in the class”
Therefore − "He studies very hard and he is the best boy in the class"
Disjunctive Syllogism

• If ¬p and p∨q are two premises, we can use Disjunctive Syllogism to


derive q.
¬p
p∨q∴q
• Example
• "The ice cream is not vanilla flavored", ¬P
• "The ice cream is either vanilla flavored or chocolate flavored", p∨q
• Therefore − "The ice cream is chocolate flavored”
Exam

You might also like