Scribd
Upload
125 views

Logic Examples

This document discusses logic and truth tables. It defines simple and compound statements, and the logical connectives of negation, conjunction, disjunction, conditional, and biconditional. Truth tables are introduced as a way to determine the truth value of compound statements based on the truth values of the simple statements. Quantifiers like some, all, no are discussed along with how to write the negation of quantified statements. Several examples are provided to demonstrate writing statements symbolically and determining their truth values using truth tables.

Uploaded by

키지아
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
125 views

Logic Examples

This document discusses logic and truth tables. It defines simple and compound statements, and the logical connectives of negation, conjunction, disjunction, conditional, and biconditional. Truth tables are introduced as a way to determine the truth value of compound statements based on the truth values of the simple statements. Quantifiers like some, all, no are discussed along with how to write the negation of quantified statements. Several examples are provided to demonstrate writing statements symbolically and determining their truth values using truth tables.

Uploaded by

키지아
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 8

LOGIC and TRUTH TABLES

Example 1 Determine whether each sentence is a statement.


a. Florida is a state in the United States.
b. How are you?
c. 9 +2 is a prime number.
9

d. x +1=5.
e. Open the door.
f. 7055 is a large number.
g. x > 3.

Compound Statement
A compound statement is formed by connecting simple statements with the
connectives and, or, if . . . then, and if and only if.

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

Negation
The negation of a statement is the opposite or the contradictory of the
statement and is denoted by the curl (∼).

The Truth Table of the Negation of


p
P ∼p
T F
F T

Example 2. Write the negation of each statement.

a. Bill Gates has a yacht.


b. Parasite was not selected as best picture at the 92nd Academy
Awards ceremony.
c. The Queen Mary 2 is the world’s largest cruise ship.
d. The fire engine is not red.
Conjunction
Conjunction is a compound statement whose simple statements
are joined by the conjunction “and”, “however”, “yet”, “but”, “also”,
“although”, “nevertheless” and “still” which is represented by the wedge
(∧) .

Disjunction
Disjunction is a compound statement whose simple statements are
joined by the word “or” and “unless” which is represented by the vel (∨) .
Conditional
Statements that are connected by “if…then”, “implies that”, “entails
that”, and similar phrases are called conditional statement denoted by
rightwards arrow (⟶). By convention the first part of the conditional is
termed the antecedent (also less often called the "implicans" or the
"protasis"), and the second part of the conditional is the consequent
(less often termed the "implicate" or "apodosis"). This, however, is not
always the case.
Biconditional
Statements that are connected by “if and only if”, “is equivalent to”,
and “is a sufficient and necessary condition for” is called biconditional
statement denoted by left right arrow (⟷). In logic, two statements have
truth functional equivalence when they have the same truth-value, not
because they have the same content

Example 3. 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.
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.
e. Today is not Friday and I am going to a movie.
f. I am going to the basketball game and I am not going to a movie.
g. I am going to the movie if and only if it is raining.
h. If today is Friday, then I am not going to a movie.

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.

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


used to indicate which simple statements are grouped together.
Example 4. Let p, q, and r represent the following.
p: You get a promotion.
q: You complete the training.
r: You will receive a bonus.

a. 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

Example 5. Let p, q, and r represent the following.


p: Kesha’s singing style is similar to Uffie’s.
q: Kesha has messy hair.
r: Kesha is a rapper.
a. Write ( p ∧q ) ⟶ r as an English sentence.
b. Write “If Kesha is not a rapper, then Kesha does not have messy hair and
Kesha’s singing style is not similar to Uffie’s.” in symbolic form.
2 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.
Negation

The Truth Table of the Negation


of p
P ∼p
T F
F T
Conjunction

The Truth Table for p ∧q


P Q p ∧q
T T T
T F F
F T F
F F F
Disjunction

The Truth Table for p ∨q


P q p ∨q
T T T
T F T
F T T
F F F
Conditional

The Truth Table for p ⟶ q


P Q p⟶q
T T T
T F F
F T T
F F T
Biconditional

The Truth Table of p ⟷ q


P Q p⟷q
T T T
T F F
F T F
F F T
Example 6. 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.
d. 21 is a rational number and 21 is a natural number.
e. 4 ≤ 9.

3 Quantifiers and Negation


In a statement, the word some and the phrases there exists and at least one
is called existential quantifiers. Existential quantifiers are used as prefixes to assert
the existence of something. While 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.

The Negation of a Quantified Statement


All X are Y negation Some X are not Y
No X are Y negation Some X are Y

Example 6. 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.
d. All bears are brown.
e. No smartphones are expensive.
f. Some vegetables are not green.
V. Post Test
A. Determine whether each sentence is a statement or NOT.

a. The smallest prime number is 2.


a
b. b ≥ 0, assume that a and b are real numbers
c. Turn off the phone.
d. Man is the measure of all things.
e. Don’t talk to strangers.

B. State whether the sentence is a conjunction, a disjunction, a


negation, a conditional, or a biconditional and write each sentence
in symbolic form. Represent each simple statement of the
sentence with the letter indicated in parentheses.

a. Nothing will end war (e) unless people themselves refuse to go


to war (r).
b. Jake is appointed as member of the board (j) implies that
someone is retiring soon (s).
c. X is an even number (e), if x is divisible by 2 (d).
d. I will major in mathematics (m) or English language (e).
e. It is false that money is the root of all evil (m).

C. Write the negation of the following quantified statement. Start each


negation with “Some,” “No,” or “All.”

a. Some women find controlling men irresistible.


b. All people of the world hate war.
c. No student finished the given task.
d. All children are special.
e. Some smartphones do not support fingerprint scanner.

D. Determine whether each statement is true or false.

Let a=3 and b=2.

a. a+ 2< b or ab=5
a
b. b >0 and 3b is an even
b+1
c. If ka−1 ≤b , then k ≤ a
a 15
d. ab+ b ≠ b
e. If x= y , then ax=by

You might also like