Scribd
Upload
17 views

LECTURE 16 Propositional Logic 1

Here are the steps to prove that p ↔ q is equivalent to (p →q) ∧ (q→p): 1. Construct the truth table for p ↔ q: p q p ↔ q T T T T F F F T F F F T 2. Construct the truth tables for p → q and q → p: p q p → q T T T T F F F T T F F T q p q → p T T T T F

Uploaded by

hardik22csu077
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
17 views

LECTURE 16 Propositional Logic 1

Here are the steps to prove that p ↔ q is equivalent to (p →q) ∧ (q→p): 1. Construct the truth table for p ↔ q: p q p ↔ q T T T T F F F T F F F T 2. Construct the truth tables for p → q and q → p: p q p → q T T T T F F F T T F F T q p q → p T T T T F

Uploaded by

hardik22csu077
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 12

Propositional Logic

Proposition
Proposition: A Proposition or a statement or logical sentence is a declarative sentence which is either true or
false but not both.

Example1: The following statements are all propositions:


Jawaharlal Nehru is the first prime minister of India.
It rained Yesterday.
If x is an integer, then x2 is a +ve integer.

Example2: The following statements are not propositions:


Please report at 11 a.m. sharp
What is your name?
x2=13
Propositional Variables: The lower case letters starting from P onwards are used to represent propositions
Example: p: India is in Asia
q: 2 + 2 = 4

2
Solved Example

3
Compound Statement and Logical
Connectives
• Compound Statements: Statements or propositional
variables can be combined by means of logical
connectives (operators) to form a single statement
called compound statements.
Symbol Connective Name
~ Not
• The five logical connectives Negation
are:
∧ And Conjunction
∨ Or Disjunction
⟶ Implies or if .. then Implication or Conditional

⟷ If and only if Equivalence or Bi-


conditional

4
Basic Logical Operations
1. Negation: It means the P ~P
opposite of the original T F
statement. If p is a statement,
F T
then the negation of p is denoted
by ~p and read as 'it is not the
case that p.' So, if p is true then
~ p is false and vice versa.
The operator ~ is sometimes
represented by the symbol ¬, a
minus sign (−), ! , or the word
"not."
• Example: If statement p is Paris
is in France, then ~ p is 'Paris is
not in France‘.
5
Basic Logical Operations
2. Conjunction: It means Anding of two
statements. If p, q are two statements,
then "p and q" is a compound statement,
denoted by p ∧ q and referred as the P Q P∧Q
conjunction of p and q. The conjunction T T T
of p and q is true only when both p and q T F F
are true. Otherwise, it is false. F T F
Example: Jill eats pizza and Sam eats F F F
pasta.

6
Basic Logical Operations
3. Disjunction: It means Oring of two
statements. If p, q are two statements,
then "p or q" is a compound statement,
denoted by p ∨ q and referred to as the P Q PVQ
disjunction of p and q. The disjunction of T T T
p and q is true whenever at least one of T F T
the two statements is true, and it is false F T T
only when both p and q are false. F F F
Example: Ann is on the softball team or
Paul is on the football team.

7
Basic Logical Operations

4. Implication / if-then (⟶): An implication p⟶q is the


proposition "if p, then q." The implication p→ q is false only when p is
true, and q is false; otherwise, it is always true. In this implication, p
is called the hypothesis (or antecedent) and q is called the conclusion
(or consequent).
Example: The followings are conditional statements.
P Q P⟶Q
• If a = b and b = c, then a = c. T T T
• If I get money, then I will purchase a computer.
T F F
F T T
F F T

8
Variations in Conditional Statement

• Contrapositive: The proposition ~q→~p is called


contrapositive of p →q.
• Converse: The proposition q→p is called the converse
of p →q.
• Inverse: The proposition ~p→~q is called the inverse
of p →q.
• Example1: Show that p →q and its contrapositive
~q→~p are logically equivalent.

9
Solved Example
Show that p →q and its contrapositive ~q→~p are
logically equivalent.
p q ~p ~q p→q ~q→~p
Solution: Construct the truth table for both the
T T F F T T
propositions:
T F F T F F
F T T F T T
F F T T T T

As, the values in both cases are same, hence both propositions are
equivalent.

10
Basic Logical Operations

5. If and Only If (↔): If p and q are two statements then "p if and
only if q" is a compound statement, denoted as p ↔ q and referred as
a bi-conditional statement or an equivalence. The equivalence p ↔ q is
true only when both p and q are true or when both p and q are false.
Example:
(i) Two lines are parallel if and only if they have the same slope.
(ii) You will pass the exam if and only if you will work hard.
P Q P↔ Q
T T T
T F F
F T F
F F T
11
Do It Yourself
• Prove that p ↔ q is equivalent to (p →q) (q→p).
→

12

You might also like