Discrete Mathematics

Department of Mathematics
SRM University-AP, Amaravati
The conjunction of proposition: 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 both p and q are true and is false
otherwise.
The conjunction of proposition: 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 both p and q are true and is false
otherwise.

The Truth Table for the conjunction of two proposition:

p q p∧q
T T T
T F F
F T F
F F F
The disjunction of proposition: 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.
The disjunction of proposition: 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.

The Truth Table for the disjunction of two proposition:

p q p∨q
T T T
T F T
F T T
F F F
The exclusive or of proposition: Let p and q be propositions. The
exclusive or of p and q, denoted by p ⊕ q, is the proposition that is
true when exactly one of p and q is true and is false otherwise.
The exclusive or of proposition: Let p and q be propositions. The
exclusive or of p and q, denoted by p ⊕ q, is the proposition that is
true when exactly one of p and q is true and is false otherwise.

The Truth Table for the exclusive or of two proposition:

p q p⊕q
T T F
T F T
F T T
F F F
Conditional Statements: Let p and q be propositions. The
conditional statement p → q, is the proposition “if p, then q”. The
conditional statement p → q is false when p is true and q is false and
true otherwise. In the conditional statement p → q, p is called the
hypothesis (or premise) and q is called the conclusion (or
consequence).
Example: If I am elected, then I will lower taxes
Conditional Statements: Let p and q be propositions. The
conditional statement p → q, is the proposition “if p, then q”. The
conditional statement p → q is false when p is true and q is false and
true otherwise. In the conditional statement p → q, p is called the
hypothesis (or premise) and q is called the conclusion (or
consequence).
Example: If I am elected, then I will lower taxes
The Truth Table for the Conditional Statements:

p q p→q
T T T
T F F
F T T
F F T
Conditional Statements: Let p and q be propositions. The
conditional statement p → q, is the proposition “if p, then q”. The
conditional statement p → q is false when p is true and q is false and
true otherwise. In the conditional statement p → q, p is called the
hypothesis (or premise) and q is called the conclusion (or
consequence).
Example: If I am elected, then I will lower taxes
The Truth Table for the Conditional Statements:

p q p→q
T T T
T F F
F T T
F F T

A variety of terminology is used to express p → q. Some of them are

as follows: “p implies q”, “p is sufficient for q”, “q whenever p”,
“p only if q”, “q is necessary for p”, “q when p”.
The proposition q → p is called the converse of p → q.
The proposition ¬q → ¬p is called the contrapositive of p → q.
The proposition ¬p → ¬q is called the inverse of p → q.
When two compound propositions always have the same truth
value we call them equivalent.
 The proposition q → p is called the converse of p → q.
The proposition ¬q → ¬p is called the contrapositive of p → q.
The proposition ¬p → ¬q is called the inverse of p → q.
When two compound propositions always have the same truth
value we call them equivalent.

Example: Show that a conditional statement and its contrapositive

are equivalent.
 The proposition q → p is called the converse of p → q.
The proposition ¬q → ¬p is called the contrapositive of p → q.
The proposition ¬p → ¬q is called the inverse of p → q.
When two compound propositions always have the same truth
value we call them equivalent.

Example: Show that a conditional statement and its contrapositive

are equivalent.
Solution:
 The proposition q → p is called the converse of p → q.
The proposition ¬q → ¬p is called the contrapositive of p → q.
The proposition ¬p → ¬q is called the inverse of p → q.
When two compound propositions always have the same truth
value we call them equivalent.

Example: Show that a conditional statement and its contrapositive

are equivalent.
Solution:

Example: Show that the converse and the inverse of a conditional

statement are also equivalent.
 The proposition q → p is called the converse of p → q.
The proposition ¬q → ¬p is called the contrapositive of p → q.
The proposition ¬p → ¬q is called the inverse of p → q.
When two compound propositions always have the same truth
value we call them equivalent.

Example: Show that a conditional statement and its contrapositive

are equivalent.
Solution:

Example: Show that the converse and the inverse of a conditional

statement are also equivalent.
Solution: Home Work
Biconditional 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.
Biconditional 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.
The Truth Table for the Biconditional Statements:

p q p↔q
T T T
T F F
F T F
F F T
Biconditional 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.
The Truth Table for the Biconditional Statements:

p q p↔q
T T T
T F F
F T F
F F T

A variety of terminology is used to express p ↔ q are as follows: “p is

necessary and sufficient for q”, “if p then q, and conversely”, “p iff q”.
Example: Construct the truth table of the compound proposition
(p ∨ ¬q) → (p ∧ q)
Example: Construct the truth table of the compound proposition
(p ∨ ¬q) → (p ∧ q)
Solution:
 Logic and Bit Operations:

Computers represent information using bits. A bit is a symbol with

two possible values, namely, 0 (zero) and 1 (one). Here 1 represents
T (true), 0 represents F (false). A variable is called a Boolean
variable if its value is either true or false. Consequently, a Boolean
variable can be represented using a bit. We will use the notation OR,
AND, and XOR for the operators ∨, ∧ and ⊕.
 Logic and Bit Operations:

Computers represent information using bits. A bit is a symbol with

two possible values, namely, 0 (zero) and 1 (one). Here 1 represents
T (true), 0 represents F (false). A variable is called a Boolean
variable if its value is either true or false. Consequently, a Boolean
variable can be represented using a bit. We will use the notation OR,
AND, and XOR for the operators ∨, ∧ and ⊕.
Table for the Bit Operators OR, AND, and XOR:

x y x ∨y x ∧y x ⊕y
1 1 1 1 0
1 0 1 0 1
0 1 1 0 1
0 0 0 0 0
 Logic and Bit Operations:

Computers represent information using bits. A bit is a symbol with

two possible values, namely, 0 (zero) and 1 (one). Here 1 represents
T (true), 0 represents F (false). A variable is called a Boolean
variable if its value is either true or false. Consequently, a Boolean
variable can be represented using a bit. We will use the notation OR,
AND, and XOR for the operators ∨, ∧ and ⊕.
Table for the Bit Operators OR, AND, and XOR:

x y x ∨y x ∧y x ⊕y
1 1 1 1 0
1 0 1 0 1
0 1 1 0 1
0 0 0 0 0

Reference
Kenneth H. Rosen, Discrete Mathematics and Its Applications;
Seventh Edition, 2012.