Logic Statements and Quantifiers

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

LOGIC STATEMENTS

AND QUANTIFIERS
One of the first mathematicians to make a serious study of symbolic logic was Gottfried
Wilhelm Leibnitz (1646-1716)

Boole published The Mathematical Analysis of Logic in 1848, An Investigation of the Laws
of Thought which made Bertrand Russell to consider that “Pure Mathematics” was
discovered by Boole.
LOGIC STATEMENTS

• Every language contains different types of sentences, questions and commands, For
instance,
“Is the test today?” is a question.
“Go get the newspaper” is a command.
“This is a nice car” is an opinion.
“Manila is the capital of the Philippines” is a statement of fact.
The symbolic logic that Boole was instrumental in creating applies only to sentences that
are statements as defined below.
DEFINITION A STATEMENT
A statement is a declarative sentence that is either true or false, but not both true
and false.

• It may not be necessary to determine whether a sentence is true to determine whether


it is a statement . For instance, consider the following sentence.

Mount Mayon is located in Palawan.

You may not know if the sentence is true, but you do know that the sentence is either
true or it is false, and that it is not both true and false. Thus, you know that the sentence is
a statement.
Determine whether each statement is a statement.
1. Florida is a state in the United states.
EXAMPLE 2. How are you?
3. 99 + 2 is a prime number.
4. x + 1 = 5

1. Florida is one of the 50 states in the United states, so this sentence is true
and it is a statement.
2. The sentence “How are you?” is a question; it is not a declarative sentence.
Thus it is not a statement.
3. You may not know whether 99 + 2 is a prime number; however, you do
SOLUTION know that it is a whole number larger than I, so it is either prime number or
it is not a prime number. The sentence is either true or it is false, and it is
not both true and false, so it is a statement.
4. X + 1 = 5 is a statement. It is known as an open statement. It is true for x=4,
and it is false for any other values of x. For any given value of x, it is true or
false but not both.
TEST No. 1 CHECK YOUR PROGRESS:
Determine whether each sentence is a statement.

1. Open the door.


2. 7055 is a large number
3. In the year 2022, the president of the Philippines is a woman.
4. X > 3.
5. Have a fun trip.
6. Do you like to read?
7. X=x+1
8. Harvey Mudd College is in Oregon.
9. January 1, 2024 will be a Sunday.
10. -1/2 is an integer.
SIMPLE STATEMENTS
AND COMPOUND STATEMENTS

DEFINITION
Simple Statements 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.
“I will attend the meeting or I will go to school.” is compound statement.
For instance:
It is composed of two simple sentences, “I will attend the meeting,” and “I will go to
school.”
The word or is a connective for the two simple sentences.
George Boole used symbols such as p, q, fr and s to represent simple
IMPORTANT: statements and the symbols Λ, V, ~ , → , and ↔ to represent connectives.

LOGIC CONNECTIVES and


SYMBOLS
Statement Connective Symbolic Form Type of statement
Not p Not ~p Negation
p and q And pΛq Conjunction
p or q Or pVq Disjunction
If p, then q If…then p→q Conditional
p if and only if q If and only if p↔q biconditional
D
E
F
I
N
I TRUTH VALUE and TRUTH
T
I TABLE
O
N The negation of the statement “Today is Friday,”
Is a statement “Today is not Friday.” In symbolic logic, the
tilde symbol ~ is used to denote the negation of a
statement.
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 If a statement p is true, its negation ~p is false, and if a
values of its simple statements and its connectives. statement p is false, its negation ~p is true.
See the table t the left:
A truth table is a table that shows the truth value of a compound Truth Table for
statement for all possible truth values of its simple statement. ~p
p ~p The negation of the negation of a
statement is the is the original
T F
statement.
F T
Thus, ~(~p) can be replaced by p in
any statement.
Write the negation of each 1. Ellie Guilding is not an opera
statement. singer.
Example Solution
1. Ellie Guilding is an opera singer. 2. The dog needs to be fed.
2. The dog does not need to be fed.

CHECK YOUR PROGRESS


TEST No. 2 Write the negation of each statement.

1. The Queen Mary 2 is the world’s largest cruise sheep.


2. The fire engine is not red.
3. The Giants lost the game.
4. The lunch was served at noon.
5. The game did not go into overtime.
WRITE COMPOUND STATEMENTS IN SYMBOLIC FORM
Write the following compound statements in symbolic form.
Consider the following simple statements. 1. Today is Friday and it is raining.
Example p: today is Friday. 2. It is not raining and I am going to a movie.
q: It is raining. 3. I am going to the basketball game or I am going to a movie.
r: I am going to a movie. 4. If it is raining, then I am not going to the basketball game.
s: I am not going to the basketball game.

Solution 1. p Λ q 2. ~q Λ r c. ~s V r d. q → s

CHECK YOUR PROGRESS


TEST No. 3 Use p,q, r, and s as defined in example above to write the following compound statements in
symbolic form.

1. Today is not Friday and I am going to a movie.


2. I am going to the basketball game and I am not going to a movie.
3. I am going to a movie if and only if it is raining.
4. If today is Friday, then I am not going to a movie.
5. I am not going to a movie if and only if I am going to the basketball game.
TRANSLATE SYMBOLIC
Consider the STATEMENTS
following statements.
p: The game will be played in Atlanta. Write the following compound statements in words.
q: The game will be shown in CBS. 1. q Λ p
Example
r: The game will not be shown on ESPN. 2. ~r Λ s
s: The Mets are fvored to win. 3. s ↔ ~p

Solution 1. The game will be shown on CBS and the game will be played in Atlanta.
2. The game will be shown ion ESPN and the Mets are favored to win.
3. The Mets are favored to win if and only if the game will not be played in Atlanta.

CHECK YOUR PROGRESS 1.) e Λ ~t


Consider the following statements. 3.) e → t
e: All men are created equal.
TEST No. 4 t: I am trading places.
a: I get Abe’s place. 4.) t ↔ g
g: I get George’s place. 2.) a V ~t
Use the above information to translate the
5.)~ e → ~ t
dialogue in the speech bubbles at the right.
GOOD LUCK…GOD BLESS…

You might also like