0% found this document useful (0 votes)
367 views

Math in The Modern World Handout

a. p → ~t means "If p, then not t" b. t ∧∼ r means "t is true and r is not true" c. ∼ p ∧ t means "p is not true and t is true" A compound statement connects two or more simple statements with logical connectors like "and", "or", and "if...then". The truth value of a compound statement depends on the truth values of the simple statements and the connectors used. Truth tables are used to determine the truth value of compound statements given the truth values of the simple statements.

Uploaded by

KATHERINE TRIXIE
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
0% found this document useful (0 votes)
367 views

Math in The Modern World Handout

a. p → ~t means "If p, then not t" b. t ∧∼ r means "t is true and r is not true" c. ∼ p ∧ t means "p is not true and t is true" A compound statement connects two or more simple statements with logical connectors like "and", "or", and "if...then". The truth value of a compound statement depends on the truth values of the simple statements and the connectors used. Truth tables are used to determine the truth value of compound statements given the truth values of the simple statements.

Uploaded by

KATHERINE TRIXIE
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/ 2

Chapter 5 LOGIC Write the following symbolic statements in words.

a. 𝑝 → ~𝑡 b. 𝑡 ∧∼ 𝑟 c. ∼ 𝑝 ∧ 𝑡
Logical Statements and Quantifiers
The Truth value of a Conjunction
Definition: A statement is a declarative sentence that is either true of false, but The conjunction 𝑝 ∧ 𝑞 is true if and only if both 𝑝and 𝑞 are true.
not both true and false.
The Truth value of a Disjunction
The disjunction 𝑝 ∨ 𝑞 is true if and only if 𝑝 is true, 𝑞 is true, or both 𝑝and 𝑞
Ex. 𝑥 + 5 = 13 For any given value of 𝑥, it is either true or false, but not
are true.
both.
Truth Table for 𝑝 ∧ 𝑞 Truth Table for 𝑝 ∨ 𝑞
Simple and Compound Statements p q p q
A simple statement is a statement that conveys a single idea. A compound T T T T T T
statement is a statement that conveys two or more ideas. T F F T F T
F T F F T T
F F F F F F
Some connectors:
∧ and ∼ not
∨ or → if … then ↔ if and only if Illustration
Determine the truth value of the following statement.
Truth Value and Truth Tables a. 9 ≥ 7
b. 2 is an odd number or 2 is an even number
The truth value of a simple statement is either true (T) or false (F). c. 15 is a natural number and also an integer
The truth value of a compound statement depends on the truth values of its
simple statements and its connectives. Equivalent Statements
A truth table is a table that shows the truth value of a compound statement for Two statements are equivalent if they are both have the same truth value for
all possible truth values of its simple statements. all possible truth values of their simple statements. The notation 𝑝 ≡ 𝑞 is used to
indicate that the statement 𝑝 and 𝑞 are equivalent.
Writing compound statements in symbolic form
Consider the following simple statements. Illustration
𝑝: Today is Friday. Show that 𝑝 ∧ (𝑞 ∨ 𝑟) and (𝑝 ∧ 𝑞) ∨ (𝑝 ∧ 𝑟) are equivalent.
𝑞: It is raining.
𝑟: I am going to school. De Morgan’s Laws for Statements
𝑡: I am going to a movie. For any statements 𝑝 and 𝑞,
∼ (𝑝 ∨ 𝑞) ≡∼ 𝑝 ∧∼ 𝑞
Write the following statements in symbolic form. ∼ (𝑝 ∧ 𝑞) ≡∼ 𝑝 ∨∼ 𝑞
a. Today is Friday and it is raining.
b. It is not raining and I am going to school.
c. I am going to school or I am going to a movie.
d. I am going to the movie if and only if it is raining.
Illustrations
It is not true that, I bought a new bike and sell my car.
It is not the case that, the student cut classes or took part in the
demonstration.

Tautologies and Self-Contradictions


A tautology is a statement that is always true. A self-contradiction is a
statement that is always false.

Illustrations
Show that (∼ 𝑝 ∨ 𝑞) ∨ (∼ 𝑞 ∨ 𝑟) is a tautology.
Show that ∼ [(𝑝 ∨ 𝑞) ∨ (∼ 𝑝 ∨ 𝑞)] is a self-contradiction.

The Conditional and the Biconditional


In any conditional statement represented by “If 𝑝, then 𝑞,” the 𝑝 statement
is called the antecedent and the 𝑞 statement is called the consequent.

Example: If I study very well, then I will pass MMW.

The conditional statement , “If 𝑝, then 𝑞,” can be written using the
arrow notation 𝑝 → 𝑞. The arrow notation 𝑝 → 𝑞 is read as “if 𝑝, 𝑡ℎ𝑒𝑛 𝑞" or as
“𝑝 implies 𝑞. "

You might also like