Propositional Logic: / Boolean A Puzzle

CS201: Discrete Mathematical Structures
Sem. 3: May-July 2011
Instructor: Narendra S. Chaudhari
Topic 1.1: Propositional Logic - I
A puzzle
If I am a student in School of Biological Sciences, I am not a student in School of Computer Science. I am student in School of Computer Science or I am not a student in School of Biological Sciences.
Propositional / Boolean Logic
Chrysippus of Soli (ca. 281 B.C. 205 B.C.)
George Boole (1815-1864)
Reading : Epp: 1.1, Grimaldi: 2.1, Rosen: 1.1
Logic
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
Examples of non-statements: a. (Question): Why are you late? b. (Command): Open the door. c. (Wish): If only I had studied a little harder d. (Something Vague): (d-i) x + y = 4. (d-ii) x>y.
CS201: Discrete Mathematical Structures 3
The Statement/Proposition
Elephants are bigger than mice.
Is this a statement? Is this a proposition? What is the truth value of the proposition?
yes yes
true Or, 1
520 < 111
Elephants are bigger than mice and ants are smaller than mice.
yes yes
yes yes
false
true Or, 1
Topic 1.1: Propositional Logic - Introduction
Elephants are bigger than mice or ants are bigger than mice.
y > 5
yes yes
Is this a statement? Is this a proposition?
yes no
true Or, 1
Its truth value depends on the value of y, but this value is not specified. specified. We call this type of statement a predicate, or an open sentence or a predicate, propositional function. function.
7 CS201: Discrete Mathematical Structures 8
Today is 27th July and 99 < 5.
Please do not fall asleep.
yes yes
Is this a statement? Its a request. It Is this a proposition?
no
no
false
Only statements can be propositions.
10
If the moon is made of cheese, then I will be rich.
x < y if and only if y > x.
*(we
yes yes
Is this a statement? yes Is this a proposition? yes because its truth value does not depend on specific values of x and y. What is the truth value of the proposition?
11 CS201: Discrete Mathematical Structures
True*
shall see the justification based on vacuous truth of conditional later.) truth
true
12
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.
Logical Operators (Connectives)

We will examine the following logical operators: Negation (NOT, ~ ; other notation ) (AND, ) (OR, )
(if then, ) (if and only if, )
Conjunction Disjunction Two more :

Conditional Biconditional
Truth tables are used to show how these operators can combine propositions to compound propositions.
Negation (NOT)
Unary Operator, Symbol: ~ (also ) p false (F) true (T) ~ p true (T) false (F)
Conjunction (AND)
Binary Operator, Symbol:
p F F T T q F T F T p q F F F T
15
16
Disjunction (OR)
p F F T T q F T F T pq F T T T
Conditional (if - then)

p F F T T q F T F T pq T T F T
17
18
Biconditional (if and only if)

p F F T T q F T F T pq T F F T
Statements and Operators

Statements and operators can be combined in any way to form new statements.
p F F T T
q F T F T
~p T T F F
~q T F T F
(~p)(~ q) T T T F
19
20
Statements and Operations

Statements and operators can be combined in any way to form new statements.
Truth Table
Construct the truth table for p or q but not both p and q called p exclusive or q, abbreviated as p q, or p XOR q. pq
p F F T T
q F T F T
pq F F F T
~ (pq) T T T F
(~p)(~ q) T T T F
p q
F F T T F T F T
pq pq ~(pq)
F T T T F F F T T T T F
(pq)~(pq)
F T T F
22
21
Exercises
Express the following statements in their propositional logic form: It rains and your sister has not loaned you an umbrella. You help me in my homework, otherwise I play football. If you work hard, then you will do well in your studies.
Puzzle Revisited
Let p = I am a student in School of Biological Sciences. Let q = I am a student in School of Computer Science. We model the given sentences as: (p ~q)(q ~p).
23
24
Equivalent Statements
p q ~ (pq) (~p)(~q)
Tautologies and Contradictions

~(pq) (~p)(~q) A tautology is a statement form that is always true. Examples:
F F T T
F T F T
T T T F
T T T F
T T T T
r (~r) ~(pq) (~p)(~q)

A contradiction is a statement form that is always false. Examples:
The statement forms ~ (pq) and (~p)(~q) are logically equivalent, since they have the same truth table, or,
the statement form ~ (pq) (~p)(~q) is always true, irrespective of whether its constituents (p, q) are true or false.
r (~r) ~[~(pq)(~p)(~q)]
The negation of any tautology is a contradiction, and the negation of any contradiction is a tautology.
26
Equivalence
Definition: two proposition forms 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
Logical Equivalence
Q: Is ~(p q) equivalent to ~p ~q ? p T T F F q p q ~(p q) T T F F T F T T F F F T ~p ~q ~p ~q F F F F T T T F T T T T
Equivalence can be established by

Constructing truth tables Using equivalence laws
A: NO.
CS201: Discrete Mathematical Structures 27 CS201: Discrete Mathematical Structures 28
Logical Equivalence
De Morgans Law: ~(p q) ~p ~q ~(p q) ~p ~q p T T F F q p q ~(p q) T T F F F T T F T F F T ~p ~q ~p ~q F F F F T T T F T T T T
29
Logical Equivalence Laws

De Morgans laws
~ ( p q ) ~ p ~ q
~ ( p q ) ~ p ~ q
Commutative
pq q p
pq q p

Associative
( p q) r p (q r )
( p q ) r p (q r )

Identity (T is tautology, F is contradiction)
p T p
p F p
Domination
pT T
pF F
Distributive p (q r ) ( p q ) ( p r ) p (q r ) ( p q ) ( p r ) [Remember?
Inverse
p ~ p F
p ~ p T
a(b+c)=ab+ac ]

Double Negation
Exercises
Show that p q ~ p q by truth table. Show that (p q) (p r) p (q r) by equivalence laws (Use the result p q ~ p q, distributivity, and, other laws )
~ (~ p) p
Idempotent
p p p
Absorption
p ( p q) p
p p p
p ( p q) p
33
34
Puzzle Revisited .. 2
Let p = I am a student in School of Biological Sciences. Let q = I am a student in School of Computer Science. We model the given sentences as: (p ~q)(q ~p). (p ~q)(q ~p) (~p ~q)(q ~p) (~p~q)(~p q)
Summary
Proposition Truth value Truth table Operators and their truth tables Equivalence of propositional statements
Definition Proving equivalence (by truth table or equivalence laws)

Propositional Logic: / Boolean A Puzzle

Uploaded by

Document Information

Original Description:

Original Title

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

Propositional Logic: / Boolean A Puzzle

Uploaded by

Copyright:

Available Formats

CS201: Discrete Mathematical Structures

Sem. 3: May-July 2011

Instructor: Narendra S. Chaudhari

Topic 1.1: Propositional Logic - I

Propositional / Boolean Logic

Chrysippus of Soli (ca. 281 B.C. 205 B.C.)

George Boole (1815-1864)

Reading : Epp: 1.1, Grimaldi: 2.1, Rosen: 1.1

CS201: Discrete Mathematical Structures

CS201: Discrete Mathematical Structures

CS201: Discrete Mathematical Structures

CS201: Discrete Mathematical Structures

Topic 1.1: Propositional Logic - Introduction

CS201: Discrete Mathematical Structures

Sem. 3: May-July 2011

Instructor: Narendra S. Chaudhari

Is this a statement? Is this a proposition?

CS201: Discrete Mathematical Structures

Is this a statement? Its a request. It Is this a proposition?

Only statements can be propositions.

CS201: Discrete Mathematical Structures

CS201: Discrete Mathematical Structures

Topic 1.1: Propositional Logic - Introduction

CS201: Discrete Mathematical Structures

Sem. 3: May-July 2011

Instructor: Narendra S. Chaudhari

Logical Operators (Connectives)

Conjunction Disjunction Two more :

CS201: Discrete Mathematical Structures

CS201: Discrete Mathematical Structures

CS201: Discrete Mathematical Structures

Conditional (if - then)

CS201: Discrete Mathematical Structures

CS201: Discrete Mathematical Structures

Topic 1.1: Propositional Logic - Introduction

CS201: Discrete Mathematical Structures

Sem. 3: May-July 2011

Instructor: Narendra S. Chaudhari

Biconditional (if and only if)

Statements and Operators

CS201: Discrete Mathematical Structures

CS201: Discrete Mathematical Structures

Statements and Operations

CS201: Discrete Mathematical Structures

CS201: Discrete Mathematical Structures

CS201: Discrete Mathematical Structures

CS201: Discrete Mathematical Structures

Topic 1.1: Propositional Logic - Introduction

CS201: Discrete Mathematical Structures

Sem. 3: May-July 2011

Instructor: Narendra S. Chaudhari

Tautologies and Contradictions

r (~r) ~(pq) (~p)(~q)

CS201: Discrete Mathematical Structures

Equivalence can be established by

Logical Equivalence Laws

CS201: Discrete Mathematical Structures

Topic 1.1: Propositional Logic - Introduction

CS201: Discrete Mathematical Structures

Sem. 3: May-July 2011

Instructor: Narendra S. Chaudhari

Logical Equivalence Laws