DS Lecture 1
DS Lecture 1
Discrete vs Continuous
• Logic
• Elementary Number Theory and Methods of Proof
• Set Theory
• Relations
• Sequences and Recursion
• Mathematical Induction
• Counting
• Relations and Equivalence Relations
• Graphs
• Trees
Reference Books
• Discrete Mathematics and its Applications
(with Combinatorics and Graph Theory)
6th Edition, The McGraw-Hill Companies, 2007,
Kenneth H. Rosen.
• Discrete Mathematics with Applications
2nd Edition, Thomson Learning, 1995,
Susanna S. Epp.
• Discrete Mathematics for Computer Scientists
2nd Edition, Addison-Wesley, 1999,
John Truss.
Logic
• Propositional Logic
• Logic of Compound Statements
• Propositional Equivalences
• Conditional Statements
• Logical Equivalences
• Valid and Invalid Arguments
• Applications: Digital Logic Circuits
• Predicates and Quantifiers
• Logic of Quantified Statements
Propositional Logic
Proposition: A proposition (or Statement) is a declarative
sentence (that is, a sentence that declares a
fact) that is either true or false, but not both.
Examples
1. Is the following sentence a proposition? If it is a proposition,
determine whether it is true or false.
Paris is the capital of France.
This makes a declarative statement, and hence is a
proposition. The proposition is TRUE (T).
Examples (Propositions Cont.)
not a proposition.
Examples (Propositions Cont.)
x+ 4 > 9.
He is a college student.
1. Not
2. And ˄
3. Or ˅
4. Exclusive or
5. Implication
6. Biconditional
Compound Propositions
Negation of a proposition
Let p be a proposition. The negation of p, denoted by
p (also denoted by ~p), is the statement
p : Today is Friday.
The negation is
p : It is not the case that today is Friday.
“6 is negative”.
The negation is
p p
true false
false true
Conjunction (AND)
Definition
Let p and q be propositions. The conjunction
of p and q, denoted by p˄q, is the proposition
“p and q”.
The conjunction p˄q is true when p and q are
both true and is false otherwise.
Examples
p : Today is Friday.
q : It is raining today.
The conjunction is
p q p q
true true true
true false false
false true false
false false false
Disjunction (OR)
Definition
Let p and q be propositions. The disjunction
of p and q, denoted by p˅q, is the proposition
“p or q”.
The disjunction p˅q is false when both p and
q are false and is true otherwise.
Examples
p : Today is Friday.
q : It is raining today.
The disjunction is
p q pq
true true true
true false true
false true true
false false false
Exclusive OR (XOR)
Definition
Let p and q be propositions. The exclusive or
of p and q, denoted by pq, is the proposition
“pq”.
The exclusive or, p q, is true when exactly
one of p and q is true and is false otherwise.
Examples
p q p q (p)(q)
true true false false false
true false false true true
false true true false true
false false true true true
Translating English to Logic
In logic form
p(pq)
Lecture Summery
P Q PQ
true true true
true false false
false true true
false false true
Conditional Statements
Biconditional Statements
Definition: Let p and q be propositions. The biconditional
statement pq, is the proposition “p if and
only if q”.
The biconditional (bi-implication) statement p
q is true when p and q have same truth
values and is false otherwise.
Biconditional (if and only if)
P Q P Q (P)(Q)
true true false false false
true false false true true
false true true false true
false false true true true
Equivalent Statements
P Q (PQ) (P)(Q) (PQ)(P)(Q)
• Examples:
• R(R)
(PQ) (P)(Q)
• If S T is a tautology, we write S T.
• If S T is a tautology, we write S T.
Tautologies and Contradictions
• A Contradiction is a statement that is always false regardless of
the truth values of the individual logical variables
Examples
• R(R)
((PQ)(P)(Q))
• The negation of any tautology is a contradiction, and
the negation of any contradiction is a tautology.
Exercises
•We already know the following tautology:
(PQ) (P)(Q)
•Nice home exercise:
•Show that (PQ) (P)(Q).
•These two tautologies are known as De Morgan’s laws.
Question 1
Given a set A = {x, y, z} and a set B = {1, 2, 3, 4}, what is the
value of | 2A 2B | ?
Answer
| 2A 2B | = | 2A | | 2B | = 2|A| 2|B| = 816 = 128
In order to minimize
cost to the city, how
should weekly garbage
collection routes be
designed for Detroit’s
350,000 households?