Scribd
Upload
7 views

Lecture 03

discrete

Uploaded by

rabbiarani16
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
7 views

Lecture 03

discrete

Uploaded by

rabbiarani16
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/ 9

NATIONAL UNIVERSITY OF MODERN LANGUAGES

MIRPUR AZAD KASHMIR CAMPUS


FACULTY OF ENGINEERING AND COMPUTER SCIENCE
DEPARTMENT OF SOFTWARE ENGINEERING
DISCRETE STRUCTURES
SEDS-123

Lecture 03 : Bi-Conditions

MR. ZEESHAN ASGHAR


(LECTURER)
BI- CONDITIONAL STATEMENTS

• Let p and q be propositions.


• The biconditional statement p ↔ q is the proposition “p if and only if q.”
• The biconditional statement p ↔ q is true when p and q have the same truth
values, and is false otherwise.
• Biconditional statements are also called bi-implications.
• p ↔ q has the same truth value as (p → q) Λ (q → p)
• “if and only if” can be expressed by “iff”
• Let p be the statement “You can take the flight” and let q be the statement “You
buy a ticket.” Then p ↔ q is the statement
• “You can take the flight if and only if you buy a ticket.”

SEDS-123 DISCRETE STRUCTURES | DEPARTMENT OF SOFTWARE ENGINEERING 3


BI- CONDITIONAL STATEMENTS

The Truth Table for the


Biconditional p ↔ q.
p q p↔ q
T T T
T F F
F T F
F F T

SEDS-123 DISCRETE STRUCTURES | DEPARTMENT OF SOFTWARE ENGINEERING 4


BI- CONDITIONAL STATEMENTS

• Construct the truth table of the compound proposition


(p ν ¬q) <→ (p Λ q).

The Truth Table of (p ν ¬q) <→ (p Λ q).


p q ¬q p ν ¬q pΛq (p ν ¬q) <→ (p Λ q)

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

SEDS-123 DISCRETE STRUCTURES | DEPARTMENT OF SOFTWARE ENGINEERING 5


GENERAL EXPRESSION

• Example: How can this English sentence be translated into a logical expression?
“You can access the Internet from campus only if you are a
computer science major or you are not a freshman.”
Solution: Let a, c, and f represent “You can access the Internet from
campus,” “You are a computer science major,” and “You are
a freshman.” The sentence can be translated into: Precedence of Logical Operators.
Operator Precedence
a → (c ν ¬f).
¬ 1
Λ 2
ν 3
→ 4
↔ 5

SEDS-123 DISCRETE STRUCTURES | DEPARTMENT OF SOFTWARE ENGINEERING 6


TAUTOLOGY & CONTRADICTION

• A compound proposition that is always true, no matter what the truth values of
the propositions that occurs in it, is called a tautology.
• A compound proposition that is always false is called a contradiction.
• A compound proposition that is neither a tautology or a contradiction is called a
contingency.

Examples of a Tautology and a Contradiction.


p ¬p p ν ¬p p Λ ¬p

T F T F
F T T F

SEDS-123 DISCRETE STRUCTURES | DEPARTMENT OF SOFTWARE ENGINEERING 7


PROPOSITIONAL EQUIVALENCES

• Compound propositions that have the same truth values in all possible cases are
called logically equivalent.
• Example: Show that ¬p ν q and p → q are logically equivalent.

Truth Tables for ¬p ν q and p → q .


p q ¬p ¬p ν q p→q
T T F T T
T F F F F
F T T T T
F F T T T

SEDS-123 DISCRETE STRUCTURES | DEPARTMENT OF SOFTWARE ENGINEERING 8


THANKS

You might also like