Scribd
Upload
4 views16 pages

3 - Propositional Logic II

The document covers propositional logic, including definitions of propositions, logic connectives, tautologies, and contradictions. It explains logical equivalences and their importance in simplifying compound propositions, along with examples and exercises for practice. The content is part of a lecture series on discrete mathematics by Andrei Bulatov.

Uploaded by

t2016.natalie
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
4 views16 pages

3 - Propositional Logic II

The document covers propositional logic, including definitions of propositions, logic connectives, tautologies, and contradictions. It explains logical equivalences and their importance in simplifying compound propositions, along with examples and exercises for practice. The content is part of a lecture series on discrete mathematics by Andrei Bulatov.

Uploaded by

t2016.natalie
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/ 16

Propositional Logic II

Introduction

Discrete Mathematics
Andrei Bulatov
Discrete Mathematics – Propositional Logic II 3-2

Previous Lecture

Propositions, primitive and compound


Logic connectives:
 negation ¬
 conjunction ∧
 disjunction ∨
 exclusive or ⊕
 implication →
 biconditional ↔
Truth tables
Discrete Mathematics – Propositional Logic 2-3

Example

`You can access the Internet from campus if you are a computer
science major or if you are not a freshman.’

p - `you can access the Internet from campus’

q - `you are a computer science major’

r - `you are a freshman’


Discrete Mathematics – Propositional Logic 3-4

Tautologies

Tautology is a compound proposition (formula) that is true for all


combinations of truth values of its propositional variables

(p → q) ∨ (q → p)

p q (p → q) ∨ (q → p)

0 0 1
0 1 1
1 0 1
1 1 1

“To be or not to be”


Discrete Mathematics – Propositional Logic 3-5

Contradictions

Contradiction is a compound proposition (formula) that is false


for all combinations of truth values of its propositional variables

(p ⊕ q) ∧ (p ⊕ ¬q)
“Black is white and
p q (p ⊕ q) ∧ (p ⊕ ¬q) black is not white”
0 0 0
0 1 0
1 0 0
1 1 0
Discrete Mathematics – Propositional Logic II 3-6

An Example

Construct the truth table of the following compound proposition

p → (¬q ∨ p)
Discrete Mathematics – Propositional Logic II 3-7

Another Example

Write the following as propositional formulas and construct the truth


tables of the resulting compound proposition

“An inhabitant of a castle in Transylvania is either sane or insane,


and is a human or a vampire”

“If a person is an insane vampire then he believes


only in false things and always lies”
Discrete Mathematics – Propositional Logic II 3-8

Web Search

discrete mathematics
OR mathematics

Find all pages that contain `discrete’ AND `mathematics’


Find all pages that contain `discrete’ OR `mathematics’
Discrete Mathematics – Propositional Logic II 3-9

Web Search
Discrete Mathematics – Propositional Logic II 3-10

Web Search

lady tiger
the other room
door sign
insane

(lady ∧ tiger) ∧ (the other room) ∧ (door ∨ sign) ∧ ¬ insane


Discrete Mathematics – Propositional Logic II 3-11

Logic Equivalences

Compound propositions Φ and Ψ are said to be logically


equivalent if the proposition Φ is true (false) if and only if Ψ is
true (respectively, false)
or
The truth tables of Φ and Ψ are equal
or
For any choice of truth values of the primitive propositions
(propositional variables) of Φ and Ψ, formulas Φ and Ψ have
the same truth value
If Φ and Ψ are logically equivalent, we write
Φ⇔Ψ
Discrete Mathematics – Propositional Logic II 3-12

Why Logic Equivalences

To simplify compound propositions


``If you are a computer science major or a freshman and you are
not a computer science major or you are granted access to the
Internet, then you are a freshman or have access to the Internet’’

To convert complicated compound propositions to certain `normal


form’ that is easier to handle

Conjunctive Normal Form CNF


Discrete Mathematics – Propositional Logic II 3-13

Example Equivalences

Implication and its contrapositive

p q p→q ¬q → ¬p
0 0 1 1
0 1 1 1
1 0 0 0
1 1 1 1

All tautologies are equivalent to T

All contradictions are equivalent to F


Discrete Mathematics – Propositional Logic II 3-14

Equivalences and Tautologies

Theorem Compound propositions Φ and Ψ are logically


equivalent if and only if Φ ↔ Ψ is a tautology.
Proof
Suppose that Φ ⇔ Ψ. Then these propositions have equal
truth tables
p q … Φ Ψ Φ↔Ψ
… … … … … 1
0 1 … 1 1 1
… … … … … …
1 0 … 0 0 1
… … … … … 1
Discrete Mathematics – Propositional Logic II 3-15

Equivalences and Tautologies (cntd)


Suppose now that Φ ↔ Ψ is a tautology. This means that for any
choice of the truth values of Φ and Ψ, Φ ↔ Ψ is true.

If Φ is true, then to make the formula Φ ↔ Ψ true Ψ must


also be true.

If Φ is false, then to make the formula Φ ↔ Ψ true Ψ must


also be false.

Q.E.D.
Discrete Mathematics – Propositional Logic II 3-16

Homework

Exercises from the Book:


No. 10(c,d), 14, 16, 17, 22, 31 (page 35)

You might also like