0% found this document useful (0 votes)
151 views12 pages

Lecture 4 S1.2.2 Mathematical Language and Symbols (Truth Tables)

Uploaded by

Dum Account
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
0% found this document useful (0 votes)
151 views12 pages

Lecture 4 S1.2.2 Mathematical Language and Symbols (Truth Tables)

Uploaded by

Dum Account
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/ 12

MATHEMATICS IN

THE MODERN WORLD


Properties of propositions
1. Valid. A proposition is valid if it is true
for every interpretation. Also known as
tautology.
Examples: R  R, P  P, R ( R)

2. Contradictory. A proposition is
contradictory if it is false for every
interpretation. Also known as absurdity.
Examples:  R  R, R( R)
Discrete Mathematics
Logical Structures copyright © 2006 esnatalio Propositional Logic
Properties of propositions
3. Contingency. A proposition is contingent if
it is true for some interpretation. Also
known as satisfiable.
Examples: P, P  Q, P  Q

Discrete Mathematics
Logical Structures copyright © 2006 esnatalio Propositional Logic
Truth Table

• A proposition can be easily


determined if valid, contradictory or
contingency by constructing truth
table.
• A truth table for a proposition in n
variables has 2n combinations of truth
values for the propositional variables.

Discrete Mathematics
Logical Structures copyright © 2006 esnatalio Propositional Logic
Truth table for unary operator

P  P
true (T) false (F)
false (F) true (T)

Discrete Mathematics
Logical Structures copyright © 2006 esnatalio Propositional Logic
Truth table for binary operators
P Q PQ P Q P Q P Q

T T T T T T

T F F T F F

F T F T T F

F F F F T T

Discrete Mathematics
Logical Structures copyright © 2006 esnatalio Propositional Logic
Illustration
Consider an electric lamp (switching
network) controlled by a mechanical switch.
Let
P the switch p
S the lamp s
1 P is closed; S is on
0 P is open; S is off

Discrete Mathematics
Logical Structures copyright © 2006 esnatalio Propositional Logic
Switch p

PS
+ 1 0
Battery Lamp s
- 0 1

Ground

Switch p Switch q PQS


1 1 1
+
Battery Lamp s 1 0 0
-
0 1 0
0 0 0
Ground

Discrete Mathematics
Logical Structures copyright © 2006 esnatalio Propositional Logic
Switch p PQS
1 1 1
Switch q 1 0 1
Battery
+ Lamp s
0 1 1
-
0 0 0
Ground

Discrete Mathematics
Logical Structures copyright © 2006 esnatalio Propositional Logic
Example

Using truth table show that the statement


 (PQ)  ( P)( Q) is valid

 ( P  Q )  ( P)  ( Q)
F T T T T F F F
T T F F T F T T
T F F T T T T F
T F F F T T T T

Discrete Mathematics
Logical Structures copyright © 2006 esnatalio Propositional Logic
Example
Construct the truth table for the statement below and
determine if it is valid, contradictory or contingency

(p  q  r)  (p  q)
T T T T T T F F T
T F T F F F F F T
T F F F T F F F F
T F F F F F F F F
F T T T T T T T T
F T T F F T T T T
F T F F T T T F F
F T F F F T T F F

Discrete Mathematics
Logical Structures copyright © 2006 esnatalio Propositional Logic
Exercise 4
Construct the truth table for the following
statements and determine if it is valid,
contradictory or contingency

1. P  (P  Q)  Q
2. (P  Q)  ~ (P  Q)
3. (A  ~A)  (~B  ~A)
4. (P  Q)  (Q  R)  (P  R)
5. P(QR)(PQ) (PR)

Discrete Mathematics
Logical Structures copyright © 2006 esnatalio Propositional Logic

You might also like