Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                

Logic 1

Download as pdf or txt
Download as pdf or txt
You are on page 1of 31

Logic

Chapter 3
Logic
Chapter 3

Section 3.1: Logic Statements and Quantifiers


Section 3.2: Truth Tables, Equivalent Statements
and Tautologies
Section 3.3: The Conditional and Biconditional
Section 3.4: The Conditional and Related
Statements
Question
"How are you today?"

Command

Logic "Go get the newspaper".

Statements Opinion
"Your shirt is nice!"

Every language contains different types of sentences,


such as statements, questions and commands. Here are
Fact
some examples:
"Bangkok is the capital of Thailand."
STATEMENT
__________________________________

A statement is a declarative sentence that is either true


or false, but cannot be both true and false at the same
time.
Identify Statements
Determine whether each sentence is a statement.

A
Cagayan de Oro is found in Mindanao. statement
B
Where have you been? not a statement

C
9³ + 2 is not a prime number. statement
D It is true for x = 4,

x + 1 = 5. open statement However it is false for


any other values of x.
SIMPLE
STATEMENT
__________________________________

A simple statement is a statement that conveys a single idea.


COMPOUND
STATEMENT
__________________________________

A compound statement is a statement that conveys two or


more ideas.

We use the following:


and, or, if... then, and if and only if
to create a compound statement.
Examples of Compound Statements
A
I will attend the meeting or I will go to school.

B
I am smart and you are handsome.

C
If you study hard, then you will get a good grade in this subject.

D
I am not going to school if and only if today is Sunday.
George Boole used letters such
as p, q, r and s to represent
simple statements and
symbols are used to represent
connectives.
Refer to the table on the left.
Example: Negation of a Statement
Write the negation of each statement.

A
~p:
Today is Friday. Today is not Friday.

B
~q:
The dog does not need to be fed. The dog needs to be fed.
Write Compound Sentences in Symbolic Form
Consider the following simple statements:

p: Today is Friday.
q: It is raining.
r: I am going to a movie.
s: I am not going to the basketball game.
Write the following compund statements in symbolic form:

Today is Friday and it is raining.


It is not raining and I am going to a movie.
I am going to a basketball game or I am going to a movie.
If it is raining, then I am not going to the basketball game.
Solution to the previous example:

p^q
~q ^ r
~s v r
q→s
Compound
Statements and
Grouping
Symbols
If a compound statement is
written in symbolic form, then
parentheses are used to
indicate which simple
statements are grouped
together.
Refer to the table on the left.
If a compound statement is
written as an English sentence,
then a comma is used to
indicate which simple
statements are grouped
together.
Refer to the table on the left.
Translate Compound Statements
Let p, q and r represent the following:

p: You get a promotion.


q: You complete the training.
r: You will receive a bonus.

Write (p ^ q) → r as an English sentence.


Write "If you do not complete the training, then you will
not get a promotion and you will not receive a bonus." in
symbolic form.
Solution to the previous example:

If you get a promotion and complete the training,


then you will receive a bonus.
~q → (~p ^ ~r)
Quantifiers and
the Negation of
Statements
with
Quantifiers
Existential
Quantifiers
__________________________________

In a statement, the word some and the phrases there exists


and at least one are called existential quantifiers.
Universal
Quantifiers
__________________________________

In a statement, the words none, no, all, and every are called
universal quantifiers.
Quantifiers and Negation
The table below illustrates how to write the negation of some quantified elements.
Negations of Statements with Quantifiers

What is the negation of the false statement,


"No doctors write in a legible manner"?

Negation:

"Some doctors write in a legible manner." or


"There exists at least one doctor who writes in a
legible manner."
Example: Negation of a Quantified Statement

Write the negation of the following statements:

Some airports are open.


All movies are worth the price of admission.
No odd numbers are divisible by 2.
Example: Negation of a Quantified Statement

Answers:

No airports are open.


Some movies are not worth the price of admission.
Some odd numbers are divisible by 2.
Truth Values
and
Truth Tables
Truth Value
__________________________________

The truth value of a simple statement is either true or false.


The truth value of a compound statement depends on the
truth of its simple statements and connectives.
Truth Table
__________________________________

A truth table is a table that shows the truth value of a compound


statement for all possible truth values of simple statements.
The truth table on the left
shows the four possible cases
that arise when we form a
conjunction of two statements.
The truth table on the left
shows the four possible cases
that arise when we form a
disjunction of two statements.
Determine the Truth Value of a Statement

Determine whether each statement is true or false:

7 ≥ 5.
3 is a whole number and 3 is an even number.
2 is a prime number and 2 is an even number.
Determine the Truth Value of a Statement

Answers:

7 ≥ 5 means 7 > 5 or 7 = 5. Because 7 > 5 is true,


therefore, this is a true statement.
Since 3 is not an even number, this is a false
statement.
This is a true statement since each simple
statement is true.

You might also like