Discrete Mathematics

Propositional Logic
 The elephant is
big.
The lion is
cruel. is equation of
2X+3Y=7
straight line.
What is your
name?
Hyderabad is the capital of Andhra
Pradesh.
Conjunction - Disjunction -
Product SUM
Express the following as Sum of elementary product and
Product of elementary Sum.
These statements are neither true nor false when the values of the
variables are not specified. we will discuss the ways that propositions
can be produced from such statements.
The statement “x is greater than 3” has two parts. The
first part, the variable x, is the subject of the statement. The second
part the predicate, “is greater than 3”refers to a property that the
subject of the statement can have. We can denote the statement “x is
greater than 3” by P(x), where P denotes the predicate “is greater
than 3” and x is the variable.
The statement P(x) is also said to be the value of the propositional
function P at x. Once a value has been assigned to the variable x,
the statement P(x) becomes a proposition and has a truth value.
 In general, a statement involving the n variables x1, x2, . . . , xn
can be denoted by P(x1, x2, . . . , xn).
A statement of the form P(x1, x2, . . . , xn) is the value of the
propositional function P at the n-tuple (x1, x2, . . . , xn), and
P is also called an n-place predicate or a n-ary predicate.

Quantification is a way to create a proposition from a proposition

function and it expresses the extent to which a predicate is true over a
range of elements.
In English, the words all, some, many, none, and few are used in
quantifications

We deal with two types of quantification here:

(i) Universal quantification, which says that a predicate is true for
every element under consideration.
(ii) existential quantification, which says that there is one or more
elements under consideration for which the predicate is true.
The area of logic that deals with predicates and quantifiers is called the
predicate calculus.
there is no limitation on the number of different quantifiers we can
define, such as “there are exactly two,”
“there are no more than three,”
“there are at least 100,” and so on.

the one that is most often seen is the uniqueness quantifier,

denoted by ∃! or ∃1. The notation ∃!xP(x) [or ∃1xP(x)] states “There
exists a unique x such that P(x) is true.”
Other phrases for uniqueness quantification include “there is exactly one”
and “there is one and only one.”

When a quantifier is used on the variable x, we say that this

occurrence of the variable is bound.
An occurrence of a variable that is not bound by a quantifier or set
equal to a particular value is said to be free.
“There is a student in your class who has not taken a
course in calculus.”
The statement says that for every student x in your school, x has a
computer or there
is a student y such that y has a computer and x and y are friends.

In other words, every student in your school has a computer or has

a friend who has a computer.
Express the statement
“If a person is female and is a parent, then this person is someone’s
mother”
as a logical expression involving predicates, quantifiers with a domain
consisting of all
people, and logical connectives.
Discrete Mathematics

Sets and Relations

Consider R form A={1,2} to B={1,2,3} then for the following relation
matrices write respect relations.
Compatibility block
{5,6}

Compatibility block {3,5,6}

Previous Compatibility block
{3,5,6}
Compatibility blocks {3,5,6},
{2,3}
Previous Compatibility
blocks {3,5,6},{2,3}
Compatibility blocks {3,5,6},{1,2,3},
{1,3,6}
Find relations which are compatible and find maximal
compatibility blocks.
Find the relations R1, R2 for the given relation matrices.
v
Find transitive closure for the following relations on
{1,2,3,4}
Discrete Mathematics

Graph Theory
Loop can be considered either a directed or a an undirected
edge.
yes
Write Adjacency list, adjacency matrix and incidence matrix
representation for the following graphs.
Given
Below
Discrete Mathematics

Counting
Find general solution for
Thank You
& All The
Best