Statements, Quantifier,s and Negations

statement is a sentence that has the property of being true or false not both
Example 1: 2 is an odd number. Example 2: John went to the store.

Questions,

commands and exclamations are not considered statements.

Recognizing Statements
Which

are statements? explain

2 + 2 = 4. Are you ill? Today is Thursday and it is raining. 7 x 8 = 13. The sky is blue or John went to school. 83 Open the window and close the door. What a beautiful day! It is 2 0clock.

simple statement is a sentence that is singular in nature and conveys one thought.
2 + 5 is 7. 6 is an odd number. The flower is red.

John

and Mary gave a party is not a simple statement because it is not singular in nature. The boy is 10 and his friend is 9 is not a simple statement because it conveys 2 thoughts.

simple open statement is a sentence that contains variables (pronouns) and it will be a proposition when replacements are made for the variables.

Example 1: He went to the store contains the variable he. When he is replaced by say John then the sentence becomes a statement. Example 2: x > 4, x is a mathematical pronoun and when it is replaced by say 1 then the sentence becomes a statement.

 Simple

statements are denoted by lower case letters p, q, r, s, t, etc. This allows reference to a statement without saying or writing the entire statement.

Example1: p: Washington was the first president of the United States.

p is true. q is false.

Example 2: q: 2 + 8 = 11.

Compound Statements
A

compound statement is a sentence which contains several simple propositions connected by connectives such as and, or, although, if and only if, if then, etc. The simple components of a compound statement are denoted by lower case letters p, q, r, s, etc. Today is Friday and it is very hot. p and q and is the connective.

Quantified Statements and Their Negations

are two basic types of quantifiers.

The universal quantifier All The existential quantifier Some

Negate

an all statement by changing the quantifier to some and negating the rest of the statement.

p: All cats purr. ~p: Some cats do not purr.

Negate

a some statement by changing the quantifier to all and negating the rest of the statement or changing some to no.

q: Some cars are blue. ~q: All cars are not blue. Or No cars are blue.

Negating Quantified Statements

and some are not and some and no are negations of each other. Negate each of the following. Explain.

All math is easy. Some dogs have 3 legs. Some classes are not boring. No persons are hungry. All speeders lose their licenses. His mother did not spank him soundly. Some people are lazy. The book fell to the floor.

 The

negation of a statement is a statement which changes the truth value of the given statement. The notation for the negation of a given statement, p, is ~p. Simple statements are usually negated by either the insertion or deletion of the word not.

Example1: p: The car is a Ford. ~p: The car is not a Ford. Example 2: q: Jane is not a good student. ~q: Jane is a good student.

Negating a Compound Statement

statement that contains more than one thought is called a compound statement. To negate a compound statement place one of the following in front of the statement.

It is not true that p. It is false that q. It is not the case that r.

Example 1: p: 2 is odd and 4 is even. ~p: It is not true that 2 is odd and 4 is even. Example 2: q: If I study hard I will succeed. ~q: It is false that if I study hard I will succeed.

Negating Statements.
Negate

each of the following.

The book is heavy. It is not raining. 3 divides 9 and 12 is a multiple of 3. The sky is gray. The division problem is difficult. The rose is red. John knows how to read but he cant do math. If an object has 3 sides then it is a square. Today is Friday or tomorrow is Wednesday.

Negations and Truth Tables

A negation, ~p, is true or it is false. Its truth table will have 2 lines (conditions) beside the heading and 2 columns.
A column is needed for p and a column is needed for ~p. p is true or false. The truth value of ~p must change the truth value of p.

~p

T
F

F
T

 Determine

help you. Each component simple statement translate to a letter, p, q, or r.

the major connective commas will

Underline each simple statement and label it with a letter or negation of the letter.

Locate

each connective and replace it with the symbol for that connective. Use parentheses or other signs of enclosure to group what comes before and after the major connective.

 It

is raining if and only if the ground is wet and the sky is dark.
It is a bi-conditional. Put under if and only if. Under It is raining put p. Under the ground is wet put q. Under the sky is dark put r.

Put

under the connective and. Use parentheses to enclose the conjunction. Translation: p (q r)

 If

2 > 4 and 7 is even, then 13 is odd or 6 + 3 = 8.

Translation:

(p q) (~r

s)

p: Today is Thursday; q: 8 is not even; r: Logic makes sense Translate into English: ~[p (q ~r)] Start with the phrase It is not true that to negate the whole proposition. Start translating with the word if Write p and follow it with the word then A comma is needed because of the parentheses. Write q followed by if and only if Write the negation of r. Translation: It is not true that, if today is Thursday then, 8 is not even if and only if logic does not make sense.