0% found this document useful (0 votes)
59 views5 pages

MATH 4 Logic Statements and Quantifiers Handout

George Boole published The Mathematical Analysis of Logic in 1848, introducing symbolic logic. Boole represented simple statements with symbols like p and q and connected them with symbols like ∧ and ∨ to form compound statements. A statement must be either true or false, while compound statements use connectors like "and" and "or" between simple statements. Boole represented negation with a tilde and developed truth tables to determine the truth value of compound statements based on the truth values of their simple component statements.
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
0% found this document useful (0 votes)
59 views5 pages

MATH 4 Logic Statements and Quantifiers Handout

George Boole published The Mathematical Analysis of Logic in 1848, introducing symbolic logic. Boole represented simple statements with symbols like p and q and connected them with symbols like ∧ and ∨ to form compound statements. A statement must be either true or false, while compound statements use connectors like "and" and "or" between simple statements. Boole represented negation with a tilde and developed truth tables to determine the truth value of compound statements based on the truth values of their simple component statements.
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/ 5

In 1848, George Boole published The ✓ A compound statement is a statement

Mathematical Analysis of Logic, the first of his that conveys two or more ideas.
contributions to symbolic logic.
Compound Statements
The symbolic logic that Boole was instrumental
in creating applies only to sentences that are Connecting simple statements with words
statements as defined below. and phrases such as and, or, if . . . then, and
if and only if creates a compound
A statement is a declarative sentence that is statement.
either true or false, but not both true and false
Example 3.1.2 The following sentences are
Example 3.1.1 Determine whether each compound statements:
sentence is a statement.
a) I will attend the meeting or I will go
a) Cagayan de Oro City is in Mindanao. to school.
b) Are you going to school? b) 0 + 5 = 5 and parrot is a bird.
c) 5 131 − 1 is an odd number. c) If you buy a ticket, then you can
d) Brush your teeth. take the flight.
e) x+4=8 d) I am not going to school if and only
if today is Sunday
Solution.
Logic Connectives George Boole used symbols
a. Cagayan de Oro City is one of the cities in
such as p, q, r, and s to represent simple
Mindanao, so the sentence is true, and it is a
statements and the symbols ~ , ∧, ∨, → and ⟷
statement.
to represent connectives. See Table 3.1.1.
b. The sentence “Are you going to school?” is a
Logic Connectives and Symbols
question; it is not a declarative sentence. Thus,
it is not a statement.

c. The sentence “5 131 − 1 is an odd number” is


either true or false, and it is not both true and
false, so it is a statement.

d. The sentence “Brush your teeth” is a


command; it is not a declarative sentence. Thus, Definition. 3.1.4 Let p be a statement. The
it is not a statement. negation of p, denoted by ~p, is the statement
“It is not the case that p.”
e. x + 4 = 8 is a statement. It is known as an
open statement. It is true for x = 4, and it is false The statement ~p is read “not p.”
for any other values of x. Example 3.1.3 Write the negation of each
Simple Statements and Compound Statements statement.

✓ A simple statement is a statement that a) p: Gary Valenciano is a singer.


conveys a single idea. b) q: The dog does not need to be fed.
Solution.

a) ~p: Gary Valenciano is not a singer.


b) ~q: The dog needs to be fed.

Definition 3.1.5 Let p and q be statements. The


conjunction of p and q, denoted by p ∧ q, is the
statement “p and q.”

Example 3.1.4 If p: 1 + 1 = 2 and q: 1 + 1 > 2,


then p ∧ q is the compound statement
Try this! Consider the following simple
“1 + 1 = 2 and 1 + 1 > 2.”
statements.
Definition 3.1.6 Let p and q be statements. The
𝑝: Today is Saturday.
disjunction of p and q, denoted by p ∨ q, is the
statement “p or q.” Example 3.1.5 If p: “You 𝑞: It is raining.
have the flu.” and q : “You miss the test.”, then p
𝑟: I am going to a movie.
∨ q is the compound statement
𝑠: I am not going to the basketball game.
“You have flu or you miss the test.”
Write the following compound statements in
Write Compound Statements in Symbolic Form
symbolic form.
Example 3.1.6 Consider the following
a) Today is not Saturday and I am going to
statements:
a movie.
p: Today is Friday. b) I am going to the basketball game and I
am not going to a movie.
q: It is raining.
c) I am going to a movie if and only if it is
r : I am going to a movie. raining.
d) If today is Saturday, then I am not going
s: I am not going to the basketball game. a movie.
Write the following compound statements in Consider the following statements.
symbolic form.
𝑝:The game will be played in Araneta Coliseum.
a) Today is Friday, and it is raining.
b) It is not raining, and I am going to a q: The game will be shown on GMA.
movie.
r : The game will not be shown on TV5.
c) I am going to the basketball game, or I
am going to a movie. s: The Blue Eagles are favored to win. Write
d) If it is raining, then I am not going to the each of the following symbolic statements in
basketball game. words.

Solution.
a) The game will be shown on GMA and 𝑟 : You will receive a bonus.
the game will be played in Araneta
a. Write 𝑝 ∧ 𝑞 ⟶ 𝑟 as an English sentence.
Coliseum.
b) The game will be shown on TV5 and the b. Write “If you do not complete the training,
Blue Eagles are favored to win. then you will not get a promotion and you will
c) The Blue Eagles are favored to win if not receive a bonus.” in symbolic form.
and only if the game will not be played
in Araneta Coliseum. Solution. (a)

Compound Statements and Grouping Symbols Because the p and the q statements both
appear in parentheses in the symbolic form,
Table 3.1.2 illustrates the use of parentheses to they are placed to the left of the comma in the
indicate groupings for some statements in English sentence.
symbolic form.

Thus the translation is:


✓ If a statement in symbolic form is If you get a promotion and complete the
written as an English sentence, then the training, then you will receive a bonus.
simple statements that appear together
in parentheses in the symbolic form will Solution. (b)
all be on the same side of the comma Because the not p and the not r statements are
that appears in the English sentence. both to the right of the comma in the English
If a compound statement is written as an English sentence, they are grouped together in
sentence, then a comma is used to indicate parentheses in the symbolic form.
which statements are grouped together.
Statements on the same side of a comma are
grouped together.

Thus the translation is:

Truth Value

The truth value of a statement is true, denoted


by T, if it is a true statement, and the truth value
Example 3.1.8 Let 𝑝, 𝑞, and 𝑟 represent the of a simple statement is false, denoted by F, if it
following. 𝑝 : You get a promotion. is a false statement.

𝑞 : You complete the training.


Note. The truth value of a compound statement even number. c. 2 is a prime number and 2 is an
depends on the truth values of its simple even number.
statements and its connectives.
Solution.
Truth Table
a) 7 ≥ 5 means 7 > 5 or 7 = 5. Because 7 > 5 is
The truth table is a table that shows the truth true, the statement 7 ≥ 5 is a true
value of a compound statement for all possible statement.
truth values of its simple statements. b) This is a false statement because 5 is not
an even number.
Table 3.1.4 shows the truth table for the
c) This is a true statement because each
negation of a statement p. This table has a row
simple statement is true.
for each of the two possible truth values of a
statement p. Each row displays the truth value Quantifiers and Negation
of ~p corresponding to the truth value of p for
this row. In a statement, the word some and the
phrases there exists and at least one are called
existential quantifiers. Existential quantifiers
are used as prefixes to assert the existence of
something.

In a statement, the words none, no, all, and


every are called universal quantifiers. The
universal quantifiers none and no deny the
existence of something, whereas the universal
quantifiers all and every are used to assert
the truth table for the conjunction of that every element of a given set satisfies
statements p and q. some condition

Table 3.1.7 illustrates how to write the


negation of some quantified statements.

Example 3.1.11 Write the negation of each of


the following statements.

a) No doctors write in a legible manner.


b) Some airports are open.
Determine whether each statement is true or c) All movies are worth the price of
false. a. 7 ≥ 5. b. 5 is a whole number and 5 is an admission
d) No odd numbers are divisible by 2.
Solution.

a) Some doctors write in a legible manner.


b) No airports are open.
c) Some movies are not worth the price of
admission.
d) Some odd numbers are divisible by 2.

You might also like