Scribd
Upload
7 views15 pages

Lesson 3 Lesson 3 Logic and Proof Techniques

The document provides an overview of basic logic and proof techniques, emphasizing the importance of mathematical logic in reasoning and its applications in computer science. It introduces propositional logic, defining propositions and their truth values, and discusses various logical connectives such as AND, OR, and NOT. Additionally, it includes examples of propositions and their truth values, along with truth tables for different logical operations.

Uploaded by

2022313644
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
7 views15 pages

Lesson 3 Lesson 3 Logic and Proof Techniques

The document provides an overview of basic logic and proof techniques, emphasizing the importance of mathematical logic in reasoning and its applications in computer science. It introduces propositional logic, defining propositions and their truth values, and discusses various logical connectives such as AND, OR, and NOT. Additionally, it includes examples of propositions and their truth values, along with truth tables for different logical operations.

Uploaded by

2022313644
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 15

Basic logic and

proof techniques
Prepared by:
Ms. Kim Reyes
IT Instructor I
DISCRETE STRUCTURE 2

Math Concept
for the Day
Brief Introduction

The rules of mathematical logic


specify methods of reasoning
mathematical statements. Greek
philosopher, Aristotle, was the
pioneer of logical reasoning.
Logical reasoning provides the
theoretical base for many areas of
mathematics and consequently
computer science. It has many
practical applications in computer
science like design of computing
machines, artificial intelligence,
definition of data structures for
Propositional Logic
Propositional Logic is concerned with statements to
which the truth values, “true” and “false”, can be
assigned. The purpose is to analyze these
statements either individually or in a composite
manner.
DISCRETE STRUCTURE 2

Prepositional Logic – Definition


A proposition is a collection of declarative
statements that has either a truth value "true” or
a truth value "false". A propositional consists of
propositional variables and connectives. We
denote the propositional variables by capital
letters (A, B, etc). The connectives connect the
propositional variables.
DISCRETE STRUCTURE 2

Prepositional Logic – Definition


Propositional logic, also known as sentential logic
and statement logic, is the branch of logic that
studies ways of joining and/or modifying entire
propositions, statements or sentences to form
more complicated propositions, statements or
sentences, as well as the logical relationships and
properties that are derived from these methods of
combining or altering statements.
M AT H E M AT I C S C L A S S DISCRETE STRUCTURE 2

Some examples of
Propositions are given
below −

Example 1
Example 2

• "Man is Mortal", it
"12 + 9 = 3 – 2", it
returns truth value
returns truth value
“TRUE”
“FALSE”
M AT H E M AT I C S C L A S S DISCRETE STRUCTURE 2

The following is not a


Proposition −

Example 1

• "A is less than 2". It is because


unless we give a specific value of A,
we cannot say whether the
statement is true or false.
Connectives

OR (∨∨) AND (∧∧) Negation/


NOT (¬¬)
Connectives

Implication / AND (∧∧) Negation/


if-then (→→) NOT (¬¬)
DISCRETE STRUCTURE 2

OR (∨∨)
The OR operation of two propositions A and B (written as A∨BA∨B)
is true if at least any of the propositional variable A or B is true.
The truth table is as follows −
DISCRETE STRUCTURE 2

AND (∧∧)
The AND operation of two propositions A and B (written as
A∧BA∧B) is true if both the propositional variable A and B is true.
The truth table is as follows −
DISCRETE STRUCTURE 2

Negation (¬¬)
The negation of a proposition A (written as ¬A¬A) is false when
A is true and is true when A is false.
The truth table is as follows −
DISCRETE STRUCTURE 2

Implication / if-then (→→)


An implication A→BA→B is the proposition “if A, then B”. It is false
if A is true and B is false. The rest cases are true.
The truth table is as follows −
DISCRETE STRUCTURE 2

If and only if (⇔⇔)


A⇔BA⇔B is bi-conditional logical connective which is true when p
and q are same, i.e. both are false or both are true.
The truth table is as follows −
DISCRETE SRUCTURE 2

Is everything clear?
Feel free to make this an open discussion
for questions or clarifications before proceeding.

You might also like