DS Chapter 01

Discrete Structures
Chapter 1
The Foundations: Logic and Proofs
Prof. Dr. Malik Sikander Hayat Khiyal

Faculty of Computer Science,
Preston University, Islamabad Campus,
85, Street 3, Sector H-8/1,
Islamabad, PAKISTAN.
[email protected]
01/31/24 Discrete Mathematics Chapter 1 1
Discrete Structures Contents
Chapter 1. The Foundations: Logic and Proofs
Chapter 2. Basic Structures: Sets, Functions, Sequences, and Sums
Chapter 3. The Fundamentals: Algorithms, the Integers, and Matrices
Chapter 4. Number Theory and Cryptography
Chapter 5. Induction and Recursion
Chapter 6. Counting
Chapter 7. Discrete Probability
Chapter 8. Advanced Counting Technique
Chapter 9. Relations
Chapter 10. Graphs
Chapter 11. Trees
Chapter 12. Boolean Algebra

Propositional Logic
Logic
 Study of reasoning.
 Specifically concerned with whether reasoning is correct.
 Focuses on the relationship among statements, not on the
content of any particular statement.
 Gives precise meaning to mathematical statements.
Propositional Logic is the logic that deals with
statements (propositions) and compound statements
built from simpler statements using so-called Boolean
connectives.
Some applications in computer science:
 Design of digital electronic circuits.
 Expressing conditions in programs.
 Queries to databases & search engines.
Logic
Crucial for mathematical reasoning
Important for program design
Used for designing electronic circuitry
(Propositional )Logic is a system based on

propositions.
A proposition is a (declarative) statement that is either
true or false (not both).
We say that the truth value of a proposition is either
true (T) or false (F).
Corresponds to 1 and 0 in digital circuits
The Statement/Proposition Game
“Elephants are bigger than mice.”
Is this a statement? yes
Is this a proposition? yes
What is the truth value

of the proposition? true

“520 < 111”

of the proposition? false

“y > 5”

Is this a proposition? no
Its truth value depends on the value of y, but this

value is not specified.
We call this type of statement a propositional
function or open sentence.
“Today is January 27 and 99 < 5.”

of the proposition? false

“Please do not fall asleep.”
Is this a statement? no
It’s a request.
Is this a proposition? no
Only statements can be propositions.

“If the moon is made of cheese,
then I will be rich.”

of the proposition? probably true

“x < y if and only if y > x.”
… because its truth value does
not depend on specific values
of x and y.
of the proposition? true
Combining Propositions
As we have seen in the previous examples, one or

more propositions can be combined to form a
single compound proposition.
We formalize this by denoting propositions with

letters such as p, q, r, s, and introducing several
logical operators or logical connectives.

Definition of a Proposition
Definition: A proposition (denoted p, q, r, …) is simply:
a statement (i.e., a declarative sentence)
 with some definite meaning, (not vague or ambiguous)
having a truth value that’s either true (T) or false (F)

 it is never both, neither, or somewhere “in between!”
 However, you might not know the actual truth value,

 and, the truth value might depend on the situation or context.
Later, we will study probability theory, in which we assign degrees
of certainty (“between” T and F) to propositions.
 But for now: think True/False only! (or in terms of 1 and 0)

Examples of Propositions
It is raining. (In a given situation)

Beijing is the capital of China. (T)
2 + 2 = 5. (F)
1 + 2 = 3. (T)
A fact-based declaration is a proposition,
even if no one knows whether it is true
 11213 is prime.
 There exists an odd perfect number.

Examples of Non-Proposition
The following are NOT propositions:
Who’s there? (interrogative, question)
Just do it! (imperative, command)
La la la la la. (meaningless interjection)
Yeah, I sorta dunno, whatever... (vague)
1 + 2 (expression with a non-true/false value )
x + 2 = 5 (declaration about semantic tokens of
non-constant value)

Truth Tables
An operator or connective combines one or more operand
expressions into a larger expression. (e.g., “+” in
numeric expressions.)
Unary operators take one operand (e.g., −3);
Binary operators take two operands (e.g. 3  4).
Propositional or Boolean operators operate on
propositions (or their truth values) instead of on
numbers.
The Boolean domain is the set {T, F}. Either of its
elements is called a Boolean value.
An n-tuple (p1,…,pn) of Boolean values is called a
Boolean n-tuple.
An n-operand truth table is a table that assigns a Boolean
value to the set of all Boolean n-tuples.
Some Popular Boolean Operator
Formal Name Nickname Arity Symbol
Negation operator NOT Unary ¬
Conjunction operator AND Binary 
Disjunction operator OR Binary 
Exclusive-OR operator XOR Binary 
Implication operator IMPLIES Binary 
Biconditional operator IFF Binary ↔

Logical Operators (Connectives)
We will examine the following logical operators:
• Negation (NOT, )
• Conjunction (AND, )
• Disjunction (OR, )
• Exclusive-or (XOR,  )
• Implication (if – then,  )
• Biconditional (if and only if,  )
Truth tables can be used to show how these operators
can combine propositions to compound propositions.
The Negation Operator
The unary negation operator “¬” (NOT)
transforms a proposition into its logical negation.
E.g. If p = “I have brown hair.”
then ¬p = “It is not the case that I have brown
hair” or “I do not have brown hair.”
The truth table for NOT:
p p
T F
F
Operand T Result
01/31/24
column
Discrete Mathematics Chapter 1
column 19
The Conjunction Operator
The binary conjunction operator “” (AND)
combines two propositions to form their logical
conjunction.
E.g. If p = “I will have salad for lunch.” and

q = “I will have steak for dinner.”
then, pq = “I will have salad for lunch and
I will have steak for dinner.”

Conjunction Truth Table
Operand columns
p q pq
T T T
T F F
F T F
F F F
Note that a conjunction p1  p2  …  pn of n
propositions will have 2n rows in its truth table
The Disjunction Operator
The binary disjunction operator “” (OR)
combines two propositions to form their
logical disjunction.
E.g. If p = “My car has a bad engine.” and

q = “My car has a bad carburetor.”
then, pq = “My car has a bad engine, or
my car has a bad carburetor.”
Meaning is like “and/or” in informal English .

Disjunction Truth Table
p q pq
T T T
T F Note difference
T from AND
F T
Note that pq meansTthat p is true, or q is
true, or both F
are F
true! F
So, this operation is also called inclusive or,
because it includes the possibility that both
p and q are true.
The Exclusive-Or Operator
The binary exclusive-or operator “” (XOR)

combines two propositions to form their logical
“exclusive or”
E.g. If p = “I will earn an A in this course.” and

q = “I will drop this course.”, then
p  q = “I will either earn an A in this course,
or I will drop it (but not both!)”

Exclusive-Or Truth Table
p q pq Note difference
T T F from OR.
T F T
F T T
F F F
Note that pq means that p is true, or q is
true, but not both!
This operation is called exclusive or,
because it excludes the possibility that both
01/31/24
p and q areDiscrete
true. Mathematics Chapter 1 25
Natural Language is Ambiguous
Note that the English “or” can be ambiguous
regarding the “both” case! p q p "or" q
“Pat is a singer or T T ?
Pat is a writer.” -  T F
“Pat is a man or F T T
Pat is a woman.” -  F F
T
Need context to disambiguate the meaning!
().
For this class, assume “or” means inclusive F
The Implication Operator
The conditional statement (aka implication)
p  q states that p implies q.
I.e., If p is true, then q is true; but if p is not true,
then q could be either true or false.
E.g., let p = “You study hard.”
q = “You will get a good grade.”
p  q = “If you study hard, then you will get a
good grade.” (else, it could go either way)
 p: hypothesis or antecedent or premise
 q: conclusion or consequence
Implication Truth Table
p q pq
T T T
The only
T F F False case!
F T T
F F T
p  q is false only when p is true but q is not true.
p  q does not require that p or q are ever true!
E.g. “(1=0)  pigs can fly” is TRUE!
Statements and Operators
Statements and operators can be combined in any way to
form new statements.
P Q P Q (P)(Q)
T T F F F
T F F T T
F T T F T
F F T T T

Statements and Operations
Statements and operators can be combined in any way to
form new statements.
P Q PQ (PQ) (P)(Q)

T T T F F
T F F T T
F T F T T
F F F T T

Exercises
To take discrete mathematics, you must have taken calculus or a
course in computer science.
– P: take discrete mathematics

– Q: take calculus
– R: take a course in computer science
PQR
Problem with proposition R
– What if I want to represent “take CS201”?

Exercises
When you buy a new car from Acme Motor Company, you get
$2000 back in cash or a 2% car loan.
– P: buy a car from Acme Motor Company

– Q: get $2000 cash back
– R: get a 2% car loan
PQR
Why use XOR here? – example of ambiguity of natural
languages

Exercises
School is closed if more than 2 feet of snow falls or if the wind
chill is below -100.
– P: School is closed
– Q: 2 feet of snow falls
– R: wind chill is below -100
QRP
Precedence among operators:
, , , , 

Equivalent Statements
P Q (PQ) (P)(Q) (PQ)(P)(Q)
T T F F T
T F T T T
F T T T T
F F T T T
The statements (PQ) and (P)  (Q) are logically equivalent, since they have the
same truth table, or put it in another way, (PQ) (P)  (Q) is always true.

Tautologies and Contradictions
A tautology is a statement that is always true.
Examples:
– R(R)
 (PQ)  (P)( Q)
A contradiction is a statement that is always false.
Examples:
R(R)
((P  Q)  (P)  (Q))
The negation of any tautology is a contradiction, and the
negation of any contradiction is a tautology.

Equivalence
Definition: two propositional statements S1 and
S2 are said to be (logically) equivalent,
denoted S1  S2 if
They have the same truth table, or
S1  S2 is a tautology
Equivalence can be established by
– Constructing truth tables
– Using equivalence laws)

Equivalence
Equivalence laws
– Identity laws, P  T  P,
– Domination laws, P  F  F,
– Idempotent laws, P  P  P,
– Double negation law,  ( P)  P
– Commutative laws, P  Q  Q  P,
– Associative laws, P  (Q  R) (P  Q)  R,
– Distributive laws, P  (Q  R) (P  Q)  (P  R),
– De Morgan’s laws,  (PQ)  ( P)  ( Q)
– Law with implication PQPQ

Exercises
Show that P  Q   P  Q: by truth table
Show that (P  Q)  (P  R)  P  (Q  R): by
equivalence laws:
– Law with implication on both sides
– Distribution law on LHS

Propositional Functions & Predicates
Propositional function (open sentence):
statement involving one or more variables,
e.g.: x-3 > 5.
Let us call this propositional function P(x), where P is
the predicate and x is the variable.
What is the truth value of P(2) ? false
What is the truth value of P(8) ? false
What is the truth value of P(9) ? true
When a variable is given a value, it is said to be
instantiated
Truth value depends on value of variable
Propositional Functions
Let us consider the propositional function
Q(x, y, z) defined as:
x + y = z.
Here, Q is the predicate and x, y, and z are the variables.
What is the truth value of Q(2, 3, 5) ? true

What is the truth value of Q(0, 1, 2) ? false
What is the truth value of Q(9, -9, 0) ? true
A propositional function (predicate) becomes a proposition when all

its variables are instantiated.

Propositional Functions
Other examples of propositional functions
Person(x), which is true if x is a person

Person(Socrates) = T
Person(dolly-the-sheep) = F
CSCourse(x), which is true if x is a computer science
course
CSCourse(CS201) = T
CSCourse(MATH155) = F
How do we say
All humans are mortal
One CS course
Universal Quantification
Let P(x) be a predicate (propositional function).
Universally quantified sentence:

For all x in the universe of discourse P(x) is true.
Using the universal quantifier :

x P(x) “for all x P(x)” or “for every x P(x)”
(Note: x P(x) is either true or false, so it is a

proposition, not a propositional function.)

Universal Quantification
Example: Let the universe of discourse be all people
S(x): x is a PU student.
G(x): x is a genius.
What does x (S(x)  G(x)) mean ?
“If x is a PU student, then x is a genius.” or
“All PU students are geniuses.”
If the universe of discourse is all PU students, then the
same statement can be written as
x G(x)

Existential Quantification
Existentially quantified sentence:
There exists an x in the universe of discourse for which
P(x) is true.
Using the existential quantifier :

x P(x) “There is an x such that P(x).”
“There is at least one x such that P(x).”
(Note: x P(x) is either true or false, so it is a

proposition, but no propositional function.)

Existential Quantification
Example:
P(x): x is a PU professor.
G(x): x is a genius.
What does x (P(x)  G(x)) mean ?
“There is an x such that x is a PU professor and x is a

genius.”
or
“At least one PU professor is a genius.”

Quantification
Another example:
Let the universe of discourse be the real numbers.
What does xy (x + y = 320) mean ?
“For every x there exists a y so that x + y = 320.”
Is it true? yes
Is it true for the natural numbers? no

Disproof by Counterexample
A counterexample to x P(x) is an object c so that P(c)
is false.
Statements such as x (P(x)  Q(x)) can be disproved

by simply providing a counterexample.
Statement: “All birds can fly.”

Disproved by counterexample: Penguin.

Negation
(x P(x)) is logically equivalent to x (P(x)).
(x P(x)) is logically equivalent to x (P(x)).
This is de Morgan’s law for quantifiers

Negation
Examples
Not all roses are red
x (Rose(x)  Red(x))
x (Rose(x)  Red(x))

Nested Quantifier
A predicate can have more than one variables.
S(x, y, z): z is the sum of x and y
F(x, y): x and y are friends
We can quantify individual variables in different ways
 x, y, z (S(x, y, z)  (x <= z  y <= z))
 x y z (F(x, y)  F(x, z)  (y != z)  F(y, z)

Nested Quantifier
Exercise: translate the following English
sentence into logical expression
“There is a rational number in between every pair of
distinct rational numbers”
Use predicate Q(x), which is true when x is a

rational number
x,y (Q(x)  Q (y)  (x < y) 
u (Q(u)  (x < u)  (u < y)))

Mathematical Reasoning

Mathematical Reasoning
We need mathematical reasoning to determine
whether a mathematical argument is correct or incorrect
and construct mathematical arguments.
Mathematical reasoning is not only important for

conducting proofs and program verification, but also
for artificial intelligence systems (drawing logical
inferences from knowledge and facts).
We focus on deductive proofs

Terminology
An axiom is a basic assumption about mathematical
structure that needs no proof.
Things known to be true (facts or proven theorems)
Things believed to be true but cannot be proved
We can use a proof to demonstrate that a particular

statement is true. A proof consists of a sequence of
statements that form an argument.
The steps that connect the statements in such a sequence
are the rules of inference.
Cases of incorrect reasoning are called fallacies.
Terminology
A theorem is a statement that can be shown to be true.
A lemma is a simple theorem used as an intermediate

result in the proof of another theorem.
A corollary is a proposition that follows directly from

a theorem that has been proved.
A conjecture is a statement whose truth value is

unknown. Once it is proven, it becomes a theorem.

Proofs
A theorem often has two parts
Conditions (premises, hypotheses)
conclusion
A correct (deductive) proof is to establish that

If the conditions are true then the conclusion is true
I.e., Conditions  conclusion is a tautology
Often there are missing pieces between conditions and

conclusion. Fill it by an argument
Using conditions and axioms
Statements in the argument connected by proper rules of
inference

Rules of Inference
Rules of inference provide the justification of the steps
used in a proof.
One important rule is called modus ponens or the law

of detachment. It is based on the tautology
(p  (p  q))  q. We write it in the following way:
p The two hypotheses p and p  q are

p q written in a column, and the conclusion
____ below a bar, where  means “therefore”.
q

Rules of Inference
The general form of a rule of inference is:
p1 The rule states that if p1 and p2 and … and pn are all

p2 true, then q is true as well.
.
.
. Each rule is an established tautology of
pn p1 ˄ p2 ˄ … ˄ pn ˄ q
____
q These rules of inference can be used in any
mathematical argument and do not
require any proof.

Rules of Inference
¬q
p pq
_____ Modus tollens
Addition _____
 pq ¬p
p˄q pq
_____ qr Hypothetical
p Simplification _____ syllogism
pr (chaining)
p
q pq
_____ Conjunction ¬p Disjunctive
p˄q _____ syllogism
q (resolution)

Arguments
Just like a rule of inference, an argument consists of
one or more hypotheses (or premises) and a conclusion.
We say that an argument is valid, if whenever all its
hypotheses are true, its conclusion is also true. However,
if any hypothesis is false, even a valid argument can lead
to an incorrect conclusion.
Proof: show that hypotheses  conclusion is true using

rules of inference

Arguments
Example:
“If 101 is divisible by 3, then 101 2 is divisible by 9. 101
is divisible by 3. Consequently, 1012 is divisible by 9.”
Although the argument is valid, its conclusion is

incorrect, because one of the hypotheses is false (“101
is divisible by 3.”).
If in the above argument we replace 101 with 102, we

could correctly conclude that 1022 is divisible by 9.

Arguments
Which rule of inference was used in the last argument?
p: “101 is divisible by 3.”

q: “1012 is divisible by 9.”
p
pq Modus ponens
_____
q
Unfortunately, one of the hypotheses (p) is false.

Therefore, the conclusion q is incorrect.

Arguments
Another example:
“If it rains today, then we will not have a barbeque
today. If we do not have a barbeque today, then we will
have a barbeque tomorrow.
Therefore, if it rains today, then we will have a
barbeque tomorrow.”
This is a valid argument: If its hypotheses are true, then

its conclusion is also true.

Arguments
Let us formalize the previous argument:
p: “It is raining today.”
q: “We will not have a barbecue today.”
r: “We will have a barbecue tomorrow.”
So the argument is of the following form:
pq
qr Hypothetical
______
syllogism
Pr

Arguments
Another example:
Gary is either intelligent or a good actor.

If Gary is intelligent, then he can count
from 1 to 10.
Gary can only count from 1 to 3.
Therefore, Gary is a good actor.
i: “Gary is intelligent.”
a: “Gary is a good actor.”
c: “Gary can count from 1 to 10.”

Arguments
i: “Gary is intelligent.”
a: “Gary is a good actor.”
c: “Gary can count from 1 to 10.”
Step 1: c Hypothesis
Step 2: i c Hypothesis
Step 3: i Modus tollens Steps 1 & 2
Step 4: aI Hypothesis
Step 5: a Disjunctive Syllogism
Steps 3 & 4
Conclusion: a (“Gary is a good actor.”)

Arguments
Yet another example:
If you listen to me, you will pass CS 320.

You passed CS 320.
Therefore, you have listened to me.
Is this argument valid?
No, it assumes ((p  q) q)  p.

This statement is not a tautology. It is false if p is false and
q is true.

Rules of Inference for Quantified Statements
x P(x)
__________ Universal
instantiation
 P(c) if cU
P(c) for an arbitrary c  U
___________________ Universal
  x P(x) generalization
 x P(x)
______________________ Existential
 P(c) for some element c  U instantiation
P(c) for some element c  U

____________________ Existential
  x P(x) generalization

Example:
Every PU student is a genius.

George is a PU student.
Therefore, George is a genius.
U(x): “x is a PU student.”
G(x): “x is a genius.”

The following steps are used in the argument:

Step 1: x (U(x)  G(x)) Hypothesis
Step 2: U(George)  G(George) Univ. instantiation
using Step 1
Step 3: U(George) Hypothesis
Step 4: G(George) Modus ponens
using Steps 2 & 3
 x P(x)
__________ Universal
 P(c) if c  U instantiation

Proving Theorems
Direct proof:
An implication p  q can be proved by showing that
if p is true, then q is also true.
Example: Give a direct proof of the theorem
“If n is odd, then n2 is odd.”
Idea: Assume that the hypothesis of this implication
is true (n is odd). Then use rules of inference and
known theorems of math to show that q must also be
true (n2 is odd).

Proving Theorems
n is odd.
Then n = 2k + 1, where k is an integer.
Consequently, n2 = (2k + 1)2.

= 4k2 + 4k + 1
= 2(2k2 + 2k) + 1
Since n2 can be written in this form, it is odd.

Proving Theorems
Indirect proof:
An implication p  q is equivalent to its contra-
positive q  p. Therefore, we can prove p  q by
showing that whenever q is false, then p is also false.
Example: Give an indirect proof of the theorem
“If 3n + 2 is odd, then n is odd.”
Idea: Assume that the conclusion of this implication is
false (n is even). Then use rules of inference and
known theorems to show that p must also be false (3n
+ 2 is even).

Proving Theorems
n is even.
Then n = 2k, where k is an integer.
It follows that 3n + 2 = 3(2k) + 2

= 6k + 2
= 2(3k + 1)
Therefore, 3n + 2 is even.
We have shown that the contra-positive of the

implication is true, so the implication itself is also true
(If 3n + 2 is odd, then n is odd).
Proving Theorems
Indirect Proof is a special case of proof by contradiction
Suppose n is even (negation of the conclusion).

Then n = 2k, where k is an integer.
It follows that 3n + 2 = 3(2k) + 2
= 6k + 2
= 2(3k + 1)
Therefore, 3n + 2 is even.
However, this is a contradiction since 3n + 2 is given to be

odd, so the conclusion (n is odd) holds.

Another Example on Proof
Anyone performs well is either intelligent or a good
actor.
If someone is intelligent, then he/she can count
from 1 to 10.
Gary performs well.
Therefore, not everyone is both intelligent and a good
actor
P(x): x performs well
I(x): x is intelligent
A(x): x is a good actor
C(x): x can count from 1 to 10

Hypotheses:
Anyone performs well is either intelligent or a good actor.
x (P(x)  I(x)  A(x))
If someone is intelligent, then he/she can count
from 1 to 10.
x (I(x)  C(x) )
Gary performs well.
P(G)
C(G)
Conclusion: not everyone is both intelligent and a good actor
x(I(x)  A(x))

Direct proof:
Step 1: x (P(x)  I(x)  A(x)) Hypothesis

Step 2: P(G)  I(G)  A(G) Univ. Inst. Step 1
Step 3: P(G) Hypothesis
Step 4: I(G)  A(G) Modus ponens Steps 2 & 3
Step 5: x (I(x)  C(x)) Hypothesis
Step 6: I(G)  C(G) Univ. inst. Step5
Step 7: C(G) Hypothesis
Step 8: I(G) Modus tollens Steps 6 & 7
Step 9: I(G)  A(G) Addition Step 8
Step 10: (I(G)  A(G)) Equivalence Step 9
Step 11: x(I(x)  A(x)) Exist. general. Step 10
Step 12: x (I(x)  A(x)) Equivalence Step 11
Conclusion: x (I(x)  A(x)), not everyone is both intelligent and a

good actor.

DS Chapter 01

Uploaded by

Copyright:

Available Formats

DS Chapter 01

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

DS Chapter 01

Uploaded by

Copyright:

Available Formats

Discrete Structures

Prof. Dr. Malik Sikander Hayat Khiyal

01/31/24 Discrete Mathematics Chapter 1 2

(Propositional )Logic is a system based on

“Elephants are bigger than mice.”

Is this a statement? yes

Is this a proposition? yes

What is the truth value

01/31/24 Discrete Mathematics Chapter 1 5

“520 < 111”

Is this a statement? yes

Is this a proposition? yes

What is the truth value

01/31/24 Discrete Mathematics Chapter 1 6

Is this a statement? yes

Its truth value depends on the value of y, but this

“Today is January 27 and 99 < 5.”

Is this a statement? yes

Is this a proposition? yes

What is the truth value

01/31/24 Discrete Mathematics Chapter 1 8

“Please do not fall asleep.”

Only statements can be propositions.

01/31/24 Discrete Mathematics Chapter 1 9

Is this a statement? yes

Is this a proposition? yes

What is the truth value

01/31/24 Discrete Mathematics Chapter 1 10

As we have seen in the previous examples, one or

We formalize this by denoting propositions with

01/31/24 Discrete Mathematics Chapter 1 12

having a truth value that’s either true (T) or false (F)

 However, you might not know the actual truth value,

01/31/24 Discrete Mathematics Chapter 1 13

It is raining. (In a given situation)

 There exists an odd perfect number.

01/31/24 Discrete Mathematics Chapter 1 14

01/31/24 Discrete Mathematics Chapter 1 15

Formal Name Nickname Arity Symbol

Negation operator NOT Unary ¬

Conjunction operator AND Binary 

Disjunction operator OR Binary 

Exclusive-OR operator XOR Binary 

Implication operator IMPLIES Binary 

Biconditional operator IFF Binary ↔

01/31/24 Discrete Mathematics Chapter 1 17

E.g. If p = “I will have salad for lunch.” and

01/31/24 Discrete Mathematics Chapter 1 20

E.g. If p = “My car has a bad engine.” and

Meaning is like “and/or” in informal English .

The binary exclusive-or operator “” (XOR)

E.g. If p = “I will earn an A in this course.” and

01/31/24 Discrete Mathematics Chapter 1 24

01/31/24 Discrete Mathematics Chapter 1 29

P Q PQ (PQ) (P)(Q)

01/31/24 Discrete Mathematics Chapter 1 30

– P: take discrete mathematics

01/31/24 Discrete Mathematics Chapter 1 31

– P: buy a car from Acme Motor Company

01/31/24 Discrete Mathematics Chapter 1 32