Course Name: Discrete Structure

Course Code: CSC-551

Credit Hours: 3(3-0)
Level: BS 2nd

Department of computer Science Government College Women University Faisalabad

 Truth Table
A truth table specifies the truth value of a compound proposition for all
possible truth values of its constituent propositions.
NEGATION (~):
• If p is a statement variable, then negation of p, “not p”, is denoted as
“~p” It has opposite truth value from p i.e., if p is true, then ~ p is
false; if p is false, then ~ p is true.

• TRUTH TABLE FOR ~ p

P ~p

T F

F T
CONJUNCTION (∧):
• If p and q are statements, then the conjunction of p and q is “p and
q”, denoted as “p ∧ q”.

• Definition
• Let p and q be propositions. The conjunction of p and q, denoted by
p˄q, is the proposition “p and q”.

• The conjunction p˄q is true when p and q are both true and is false
otherwise.
TRUTH TABLE FOR p ∧ q
P q p∧q

T T T

T F F

F T F

F F F

Remarks
p ∧ q is true only when both p and q are true.
If either p or q is false, or both are false, then p ∧ q is false
DISJUNCTION (∨) or INCLUSIVE OR
• If p & q are statements, then the disjunction of p and q is “p or q”,
denoted as “p ∨ q”.

Definition
• Let p and q be propositions. The disjunction of p and q, denoted by
p˅q, is the proposition “p or q”.

• The disjunction p˅q is false when both p and q are false and is true
otherwise
TRUTH TABLE FOR p ∨ q
Remarks:
• p ∨ q is true when at least one of p or q is true.
• p ∨ q is false only when both p and q are false.
P q pvq

T T T

T F F

F T F

F F F
TRUTH TABLE FOR ~ p ∧ q
TRUTH TABLE FOR p ∧ (q ∨ ~ r)
Truth table for (p∨q) ∧ ~ (p∧q)