[INT 1358]: Discrete Mathematics I

1.1 Propositional Logic

Proposition
Definition: A proposition (denoted p, q, r, . . .)
• A statement (not an order or a question)
• Definitive (not vague or undefined)
• Either True or False, but not both at the same time
• Truth value might be known or conditional

Proposition Logic
Definition: Propositional Logic deals with statements (propositions) and compound statements
built from simpler statements using logical connectives.
Exclusive OR
Negation
p q p⊕q
p ¬p T T F
T F T F T
F T F T T
F F F
Conjunction
Implication
p q p∧q
T T T p q p→q
T F F T T T
F T F T F F
F F F F T T
F F T
Disjunction (Inclusive OR)
Biconditional
p q p∨q
T T T p q p↔q
T F T T T T
F T T T F F
F F F F T F
F F T

Converse, Contrapositive, Inverse

• The converse of p → q is q → p
• The contrapositive of p → q is ¬q → ¬p
• The inverse of p → q is ¬p → ¬q

1
[INT 1358]: Discrete Mathematics I

Precedence of Logical Operators

Operator Precedence
¬ 1
∧ 2
∨ 3
→ 4
↔ 5

1.1 pg. 13 # 13
Let p and q be the propositions
• p: You drive over 65 miles per hour.

• q: You get a speeding ticket.

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

b) You drive over 65 miles per hour, but you do not get a speeding ticket.
p ∧ ¬q

c) You will get a speeding ticket if you drive over 65 miles per hour.
p→q

f) You get a speeding ticket, but you do not drive over 65 miles per hour. q ∧ ¬p

g) Whenever you get a speeding ticket, you are driving over 65 miles per hour.
q→p

1.1 pg. 14 # 23
Write each of these statements in the form “if p, then q” in English. [Hint: Refer to the list of
common ways to express conditional statements.]

a) It snows whenever the wind blows from the northeast.

If the wind blows from the northeast, then it snows.

b) The apple trees will bloom if it stays warm for a week.

If it stays warm for a week, then the apple trees will bloom.

c) That the Pistons win the championship implies that they beat the Lakers.
If the Pistons win the championship, then they beat the Lakers.

d) It is necessary to walk 8 miles to get to the top of Long’s Peak.

If you get to the top of Long’s Peak, then you walked 8 miles.

2
[INT 1358]: Discrete Mathematics I

1.1 pg. 14 # 25
Write each of these propositions in the form “p if and only if q” in English.

a If it is hot outside you buy an ice cream cone, and if you buy an ice cream cone, it is hot
outside.
You buy an ice cream cone if and only if it is hot outside.

b For you to win the contest it is necessary and sufficient that you have the only winning ticket.
You win the contest if and only if you have the only winning ticket.

c You get promoted only if you have connections, and you have connections only if you get
promoted.
You get promoted if and only if you have connections.

d If you watch television your mind will decay, and conversely.

Your mind will decay if and only if you watch television.

1.1 pg. 15 # 33
Construct a truth table for each of these compound propositions

a) (p ∨ q) → (p ⊕ q)
p q p∨q p⊕q (p ∨ q) → (p ⊕ q)
T T T F F
T F T T T
F T T T T
F F F F T

c) (p ∨ q) ⊕ (p ∧ q)
p q p∨q p∧q (p ∨ q) ⊕ (p ∧ q)
T T T T F
T F T F T
F T T F T
F F F F F

d) (p ↔ q) ⊕ (¬p ↔ q)
p q ¬p p ↔ q ¬p ↔ q (p ↔ q) ⊕ (¬p ↔ q)
T T F T F T
T F F F T T
F T T F T T
F F T T F T

3
[INT 1358]: Discrete Mathematics I

1.1 pg. 15 # 37
Construct a truth table for each of these compound propositions

a) p → (¬q ∨ r)
p q r ¬q ¬q ∨ r p → (¬q ∨ r)
T T T F T T
T T F F F F
T F T T T T
T F F T T T
F T T F T T
F T F F F T
F F T T T T
F F F T T T

b) ¬p → (q → r)
p q r ¬p q → r ¬p → (q → r)
T T T F T T
T T F F F T
T F T F T T
T F F F T T
F T T T T T
F T F T F F
F F T T T T
F F F T T T

d) (p → q) ∧ (¬p → r)
p q r ¬p p → q ¬p → r (p → q) ∧ (¬p → r)
T T T F T T T
T T F F T T T
T F T F F T F
T F F F F T F
F T T T T T T
F T F T T F F
F F T T T T T
F F F T T F F

f) (¬p ↔ ¬q) ↔ (q ↔ r)

4
[INT 1358]: Discrete Mathematics I

p q r ¬p ¬q ¬p ↔ ¬q q↔r (¬p ↔ ¬q) ↔ (q ↔ r)

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

Bit Operations
A bit string is a sequence of zero or more bits. The length of this string is the number of bits in
the string.

The bitwise OR, bitwise AND, and bitwise XOR of two strings of the same length to be the
strings that have as their bits the OR, AND, and XOR of the corresponding bits in the two strings,
respectively. We use the symbols ∨, ∧, and ⊕ to represent the bitwise OR, bitwise AND, and
bitwise XOR operations, respectively.

1.1 pg. 16 # 43
Find the bitwise OR, bitwise AND, and bitwise XOR of each of these pairs of bit strings.

a) 101 1110, 010 0001

OR: 111 1111
AND: 000 0000
XOR 111 1111

b) 1111 0000, 1010 1010

OR: 1111 1010
AND: 1010 0000
XOR: 0101 1010

c) 00 0111 0001, 10 0100 1000

OR: 10 0111 1001
AND: 00 0100 0000
XOR: 10 0011 1001

d) 11 1111 1111, 000 0000 0000

OR: 11 1111 1111
AND: 00 0000 0000
XOR: 11 1111 1111