Logic Statements and

Quantifiers
Reporter: Yasmin M. Miro
 Table of contents

01 02

Logic Statements Simple Statements and

Compound Statements

03 04

Compound Statements Quantifiers and

and Grouping Symbols Negation
 01
Logic Statements
 Logic statements
Every language contains different types of sentences, such as
statements, 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.
“Denver is the capital of Colorado” is a statement of fact.

The symbolic logic that Boole was instrumental in creating applies only
to sentences that are statements as defined next slide.
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.
 Yosimete National Park is located in California.
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 is not both true and false. Thus
you know that the sentence is a statement.

Example: Florida is a state in the United States.

 02
Simple Statements and
Compound Statements
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. For instance, “I will
attend the meeting or I will go to school.” is a compound statement. It is
composed of the two simple statements, “I will attend the meeting.” and “I
will go to school.” The word “or” is a connective for the two simple
statements.

• George Boole used symbols such as p, q, r, and s to represent simple

statements and the symbols ˄, ˅, ~, →, and ↔ to represent connectives.

7
 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 p˅q Disjunction

If p, then q If … then p→q Conditional

p if and only if q If and only if p↔q Biconditional

8
Truth Value 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.
• The negation of the statement “Today is Friday.” is the statement “Today is
not Friday.” In symbolic logic, the tilde symbol ~ is used to denote the
negation of a statement.
• If a statement p is true, its negation ~p is false, and if a statement p is false,
its negation ~p is true.
p ~p
T F

F T

• The negation of the negation of a statement is the original statement. Thus ~

(~p) can be replaced by p in any statement.
Examples:

a. Ellie Goulding is an opera singer

b. The dog does not need to be fed.

Solution:

c. Ellie Goulding is not an opera singer.

d. The dog needs to be fed.
Write Compound Statements 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 compound statements in symbolic form.

a. Today is Friday and it is raining.
b. It is not raining and I am going to a movie.
c. I am going to the basketball game or I am going to a movie.
d. If it is raining, then I am not going to the basketball game.

Solution: a. p ˄ q b. ~ q ˄ r c. ~ s ˅ r d. q → s
Translate Symbolic Statements

Consider the following statements:

• p: The game will be played in Atlanta.
• q: The game will be shown on CBS.
• r: The game will not be shown on ESPN.
• s: The Mets are favored to win.

Write each of the following symbolic statements in words.

a. q ˄ p b. ~ r ˄ s c. s ~p

Solution:
a. The game will be shown on CBS and the game will be played in Atlanta.
b. The game will be shown on ESPN and the Mets are favored to win.
c. The Mets are favored to win if and only if the game will not be played in Atlanta.
03
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. the table
below illustrates the use of parentheses to indicate groupings for some
statements in symbolic form.
Symbolic Form The parentheses indicate that:

p ˄ (q ˅~ r) q and ~r are grouped together.

(p ^ q) ˅ r p and q are grouped together.

(p ˄ ~ q) → (r ˅ s) p and ~q are grouped together.

r and s are also grouped together.

• If a compound sentence is written as an English sentence, then a comma is

used to indicate which simple statements are grouped together. Statements
on the same side of a comma are grouped together.
 English sentence The comma indicates that:

p, and q, or not r. q and ~r are grouped together because they are both on
the same side of the comma.
p and q, or r. p and q are grouped together because they are both on the
same side of the comma.
If p and not q, then p and ~q are grouped together because they are both to
r or s. the left of the comma.
r and s are grouped together because they are both to the
right of the comma.

• If a statement in symbolic form is written as an English sentence, then the

simple statements that appear together in parentheses in the symbolic form
will all be on the same side of the comma that appears in the English
sentence.
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.

Solution:
a. Because the p and the q statements both appear in parentheses in the
symbolic form, they are placed to the left of the comma in the English sentence.
(p^q)→r

If you get a and you complete , then you will receive

promotion the training a bonus.
Thus, the translation is: If you get a promotion and complete the training, then
you will receive a bonus.

b. Because the not p and the not r statements are both to the right of the comma
in the English sentence, they are grouped together in parentheses in the symbolic
form.

If you do not complete , then you will not get and you will not
the training a promotion receive a bonus

~q→(~p^~r)

Thus, the translation is: ~ q → ( ~ p ^ ~ r )

• The use of parentheses in a symbolic statement may affect the meaning of the
statement. For instance, ~ ( p ˅ q ) indicates the negation of the compound statement p
˅ q. however, ~p ˅ q indicates that only the p statement is negated.
• The statement ~( p ˅ q ) is read as, “It is not true that, p or q.” The statement ~p ˅ q is
read as, “Not p or q.”

Truth table for p ^ q: p q p^q

T T T
T F F
F T F
F F F
T: TrueF: False

• In general, the conjunction p ^ q is true if both p and q are true, and the conjunction is false
if either p or q is false. The truth table in the above shows the four possible cases that arise
when we form a conjunction of two statements.
Truth value of a Conjunction
• The conjunction p ^ q is true if and only if both p and q are true.

Sometimes, the word “but” is used in place of the connective “and”. For
instance, “I ride my bike to school, but I ride the bus to work,” is equivalent to the
conjunction, “I ride my bike to school and I ride the bus to work.”
Any disjunction p ˅ q is true if p is true or q is true or both p and q are true. The
truth table below shows that the disjunction p or q is false if both p and q are false;
however, it is true in all other cases.

p q p˅q

T T T
T F T
F T T
F F F
Truth table for p ˅ q
Truth Value of a Disjunction
• The disjunction p ˅ q is true if and only if p is true, q is true, or both p and q are
true.

Determine the Truth Value of a Statement

Determine whether each statement is true or false.

a. 7 ≥ 5.
b. 5 is a whole number and 5 is an even number.
c. 2 is a prime number and 2 is an even number.

Solution:
d. 7 ≥ 5 means 7 > 5 or 7 = 5. because 7 > 5 is true, the statement 7 ≥ 5 is a true statement.
e. This is a false statement because 5 is not an even number.
f. This is a true statement because each simple statement is true.
 04
Quantifiers and
Negation
• 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
that every element of a given set satisfies some condition.

Statement Negation

All X are Y. Some X are not Y.

No X are Y. Some X are Y.

Some X are not Y. All X are Y.

Some X are Y. No X are Y.

The negations of the statement in the first column are shown in the
second column. Vice versa. Thus the information in the previous table
can be shown more compactly as in table below:

Quantified Statements and Their Negations Displayed in a Compact Format

All X are Y. Negation Some X are not Y.

No X are Y. Negation Some X are Y.

Write the Negation of a Quantified Statement

Write the negation of each of the following statements.

a. Some airports are open.
b. All movies are worth the price of admission.
c. No odd numbers are divisible by 2.

Solution:
d. No airports are open.
e. Some movies are not worth the price of admission.
f. Some odd numbers are divisible by 2.
Thank you!