Scribd
Upload
6 views60 pages

M1 (1,2&3)

Uploaded by

rahmafathima084
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
6 views60 pages

M1 (1,2&3)

Uploaded by

rahmafathima084
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/ 60

DISCRETE

MATHEMATICS

JEMSHEENA P S
ASSISTANT PROFESSOR
Module I

Ma ematical
Logic
Propositions ,Logical
Operat s & Tru Tables
1
Propositions
C
O
N
T
CONTENTS 2
Logical Operat s
E

& Tru Tables


N
T
S
Introduction

One of the main aims of logic is to provide rules by which


one can determine whether any particular argument or
reasoning is valid( correct )
An object or formal language is one in which the syntax is
well defined

Every scientific discipline develops it's own object


language which consists of certain well defined terms and
well specified uses of this terms.The only difference
between logic and other disciplines is that in other
disciplines we are concerned with the use of the object
language while in logic we are interested in analyzing our
object language as we are in using it.
Importance of Mathematical Logic

The rules of logic give precise meaning to mathematical


statements. These rules are used to distinguish between valid
and invalid mathematical arguments.
Apart from its importance in understanding mathematical
reasoning, logic has numerous applications in Computer
Science, varying from design of digital circuits, to the
construction of computer programs and verification of
correctness of programs.
01 Propositions
A statement or Proposition is a declarative sentence that is
either universally true or universally false but not both.

The Truth Value of a proposition is True(denoted as T) if


it is a true statement, and False(denoted as F) if it is a
false statement.
Atomic and Molecular Statements
A statement is atomic if it cannot be divided into smaller
statements,
otherwise it is called molecular or compound
These are statements (in fact, atomic statements):

• Telephone numbers in the USA have 10 digits.


• The moon is made of cheese.
• 42 is a perfect square.
• Every even number greater than 2 can be expressed
as the
sum of two primes.
• 42 is a perfect square.
• Every even number greater than 2 can be expressed
as the sum of two primes.
These are not statements:

Would you like some cake?


• The sum of two squares.
• 1 + 3 + 5 + 7 + · · · + 2n + 1.
• Go to your room!
• 3 + x  12
The propositions are combined together using Logical
Connectives or Logical Operators.
02 Logical Operat s &
Tru Tables
Truth Table
Since we need to know the truth value of a proposition in all
possible scenarios, we consider all the possible combinations
of the propositions which are joined together by Logical
Connectives to form the given compound proposition. This
compilation of all possible scenarios in a tabular format is
called a truth table.
1. Negation-
If p is a proposition, then negation of p is a proposition which is-
True when p is false
False when p is true.
2. Conjunction-
Example-

If p and q are two propositions where-

p:2+4=6
q : It is raining outside.

Then, conjunction of p and q is-

p ∧ q : 2 + 4 = 6 and it is raining outside


3. Disjunction-
Example-

If p and q are two propositions where-

p:2+4=6
q : It is raining outside

Then, disjunction of p and q is-

p ∨ q : 2 + 4 = 6 or it is raining outside
4. Conditional-
Proposition of the type “If p then q” is called a
conditional or implication proposition.
Examples-

If a = b and b = c then a = c.
If I will go to Australia, then I will earn more money.
5. Biconditional-
If p and q are two
propositions, then-
Proposition of the type “p if
and only if q” is called a
biconditional or bi-
implication proposition.
It is true when either both p
and q are true or both p and
q are false.
It is false in all other cases.
Examples-

He goes to play a match if and only if it does not rain.


Birds fly if and only if sky is clear.
Exclusive or
TRUTH TABLE
PRECEDENCE RULE
PROBLEMS
Tautology-
A compound proposition is called tautology if and only if it is true for all possible truth values of its propositional
variables.
It contains only T (Truth) in last column of its truth table.

Contradiction-
A compound proposition is called contradiction if and only if it is false for all possible truth values of its
propositional variables.
It contains only F (False) in last column of its truth table.
Contingency-

A compound proposition is called contingency if and only if it is neither a tautology nor a contradiction.
It contains both T (True) and F (False) in last column of its truth table.
Well-formed Formulas
A statement formula is not a statement but a statement can be
obtained from it by replacing the variables by statements. A statement
formula is an expression which is a string consisting of variables
(capital letters with or without subscripta), parentheses, and connective
symbols Not every string of these symbols is a formula.
A well-formed formula can be generated by the following rules
Well-formed Formulas
Substitution instance
THANK YOU

You might also like