You are on page 1of 26

LOGIC

Logic
 the science of reasoning, proof, thinking
or inference
 allows us to analyze arguments and
determine whether it is valid or invalid
 a tool used in mathematical proofs
 Includes: a language for expressing
complicated compound statements, a
concise notation for writing them, and a
methodology for objectively reasoning
about their truth or falsity.
Historical Background
Logic Statements
A statement is a declarative sentence that
is either true or false, but not both true
and false.
Example 1
Simple and Compound Statements
A simple statement is a statement that
conveys a single idea.
A compound statement is a statement that
conveys two or more ideas.
 Connecting simple statements with words
and phrases such as and, or, if...then, and if
and only if creates a compound
statement.
Logical Connectives and Symbols
Example 2
Example 3: Writing Statements in
Symbolic Form
Example 4: Translating Symbolic
Form of Statements
Grouping Symbols
If a compound statement is written in
symbolic form, then parenthesis are used
to indicate which simple statements are
grouped together.
Grouping Symbols
If a compound statement is written as an
English sentence, then a comma is used to
indicate which simple statements are
grouped together.
Example 5
Truth Values and Truth Tables
The truth value of a simple statement is
either true (T) or false (F).
The truth value of a compound statement
depends on the truth values of its simple
statements and its connectives.
A truth table is a table that shows the truth
value of a compound statement for all
possible truth values of its simple
statements.
Truth Table for a Negation
Truth Table for a Conjunction
Truth Table for a Disjunction
Example 6
Example 7
Construct the truth table for the following:
Equivalent Statements
 Two statements are equivalent if they
have the same truth value for all possible
truth values of their simple statements
 denoted by 

Example:
De Morgan’s Law for Statements
Conditional Statements
 written in the form if p, then q (p  q)
 shows an implication; that is, given that a
situation p will happen (antecedent or
hypothesis), another situation q will
happen (consequent or conclusion).
 Most theorems in mathematics are in the
form of a conditional.
Other Ways to Express p  q
 If p, q.
 p implies q.
 q, if p.
 q when p.
 p is sufficient for q.
 q is necessary for p.
 p only if q.
 q whenever p.
 q follows from p.
Statements Equivalent to p  q
Truth Table for the Conditional
Example 8
Construct the truth table for the following
statements.

You might also like