Scribd
Upload
41 views

Module 2B. Elementary Logic

This document provides an overview of key concepts in mathematical language and logic, including: - Ordered pairs and Cartesian products define relationships between elements of sets. - Relations describe pairings between elements, while functions assign each input a unique output. - Elementary logic uses connectives like NOT, AND, OR to combine propositions, and quantifiers like "there exists" and "for all" to indicate scope.

Uploaded by

Nicole Ventura Ancheta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
41 views

Module 2B. Elementary Logic

This document provides an overview of key concepts in mathematical language and logic, including: - Ordered pairs and Cartesian products define relationships between elements of sets. - Relations describe pairings between elements, while functions assign each input a unique output. - Elementary logic uses connectives like NOT, AND, OR to combine propositions, and quantifiers like "there exists" and "for all" to indicate scope.

Uploaded by

Nicole Ventura Ancheta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 34

Module 2B

MATHEMATICS AS A LANGUAGE

INSTRUCTOR
IVY CARISSA FAITH A. BUENO
LEARNING OUTCOMES
At the end of the topic, the learners should be able to:
• Classify the characteristics of mathematical language;
• Differentiate expressions from sentences;
• Identify conventions in the mathematical language;
• Define sets and relations;
• Perform operations on mathematical expressions correctly;
• Define simple statement and compound statement;
• Write compound statements using connectives;
• Express simple and compound statements symbolically; and
• Write the negation of a quantified statement.
TOPIC 1

ORDERED PAIRS AND


CARTESIAN
ORDERED PAIRS AND CARTESIAN
ORDERED PAIRS
 Given elements and , the symbol denotes the ordered
pair consisting of and
 is the first element of the pair and is the second
element.
 Two ordered pairs and are equal if and only if, and .
TRY!!!

Which of the following are true statements?


a.Is ? NO

b.Is ? YES

c.What is the first element of ? 2

d. What is the second element of ? 16


ORDERED PAIRS AND CARESIAN
CARTESIAN PRODUCTS
 Given sets and B, cartesian product is written as read
“A cross B” is the set of all ordered pairs (a, b) where a
is in A and b is in B.
Let and

¿ {(1 , 𝑢) , , , , ,

¿ {(𝑢 ,1) , , , , ,

¿ {(1,1) , , , , , , , ,}
TOPIC 2
THE LANGUAGE OF RELATION
AND FUNCTION
THE LANGUAGE OF RELATION AND FUNCTION
RELATION
 A relation R on a set S is a subset of (set of ordered pairs)
 A rule which determines PAIRING between element of one set
and elements of another (or the same) set.

𝐵= {1,9 } 𝑅 : 𝑥< 𝑦

EXAMPLE # 1
𝐵= {1,5 }

D = Relation in A; D:
D

G:
G = Relation from A to B; x> y
𝐺={ ( 2,1 ) , ( 4 ,1 ) ,( 6,1) }
EXAMPLE # 2

Let

*
*
CLASSIFICATION OF RELATION
a. One-to-one c. One-to-many

b. Many-to-one d. Many-to-many
THE LANGUAGE OF RELATION AND FUNCTION
FUNCTIONS
 A function f from a set A to a set B is a rule of
correspondence that assigns to each element x in the
set A exactly one element y in the set B.
 A relation describes that each input should only have
one or unique output
 The input shouldn’t be repeated.
CLASSIFICATION OF RELATION
a. One-to-one c. One-to-many

b. Many-to-one d. Many-to-many
TRY!!!
{(W, -2), (O, -1), (R, 0), (L, 1), (D, 2)} {(W, -2), (O, -1), (R, 0), (L, 1), (L, 2)}

LETTER NUMBER LETTER NUMBER

W -2 W -2

O -1 O -1

R 0 R 0

L 1 L 1

D 2 D 2

FUNCTION
One ???
to One Relation One to Many Relation
FUNCTION ???
TRY!!!
{(W, -2), (O,-2), (R, 0), (L, 1), (L, 2), (D, 2)} {(W, -2), (O,-2), (R, 0), (L, 1), (D, 2)}

LETTER NUMBER LETTER NUMBER

W -2 W -2

O -1 O -1

R 0 R 0

L 1 L 1

D 2 D 2

Many to Many Relation


FUNCTION ??? Many to One Relation
FUNCTION ???
TOPIC 3
ELEMENTARY LOGIC:
connectives, variables, quantifiers, and negations
ELEMENTARY LOGIC
LOGIC
 branch of philosophy concerned with analyzing the patterns
of reasoning by which a conclusion is drawn from a set of
premises, without reference to meaning or context.
 Study of methods and principles used to discriminate
correct from incorrect reasoning.
 Science of reasoning
ELEMENTARY LOGIC
DEFINITION OF TERMS
REASONING
 sort of inferring
 conclusions are drawn from given premises
TRUTH VALUE
 one of the values “truth” (T) or “falsity” (F) assigned
to a statement.
PROPOSITIONS/ STATEMENTS
 Declarative sentences that has a truth value
Examples: NOTE: (True or False, but not both)

1) 2 is an even number T (Proposition)


2) is a whole number
F (Proposition)
3) (NOT a Proposition)
NEITHER
4) A is a vowel T (Proposition)
5) , when x = 2
F (Proposition)
6) My house is big. NEITHER (NOT a Proposition)
Determine whether the following are propositions or not.

1) Manila is the capital city of the Philippines (Proposition)

2) Pneumonoultramicroscopicsilicovolcanoconiosis is the
longest word in a major dictionary. (Proposition)

(Proposition)
3) Scientifically, eggplant is not a vegetable.
(NOT a Proposition)
4) Rodrigo Duterte is a great president.
PROPOSITIONS or STATEMENTS

SIMPLE STATEMENTS COMPOUND STATEMENTS

independent clause that a sentence that has at least two


conveys a single, complete independent clauses joined by a
thought connectives or operations
 The highest mountain in the  The highest mountain in the Philippines
Philippines is Mt. Apo. is Mt. Apo and the second highest
 Cebu is the oldest city in the mountain is Mt. Pulag.
Philippines.  We will go to Camiguin or we will go to
Mactan Island.
CONNECTIVES
 combines one or more operand expressions into a larger
expression
 Unary operators take 1 operand (e.g., −3).
 Binary operators take 2 operands (e.g., 3 × 4).
CONNECTIVES ARITY SYMBOL
NOT Unary ¬ or ~
AND Binary ∧
OR Binary ∨
IF…THEN Binary →
IFF Binary ↔
NEGATION
 Uses NOT
 We use the symbol ⁓ or ¬

Example:
p
I am at work.
I am not at work.
⁓p
CONJUNCTION
 Connects propositions using AND
 We use the symbol ^

Example:
p
I am at work. It is raining.
q

I am at work, and it is raining. p^q


DISJUNCTION
 Connects propositions with OR
 We use the symbol v

Example:
My car has a bad engine. p

My car has a bad carburetor. q

Either my car has a bad engine, or my car has a bad carburetor


pvq
IMPLICATION / CONDITIONAL STATEMENT
 Connects the connective Example:
My car has a bad engine. p
IMPLIES
q
 We use the symbol → My car has a bad carburetor.
 if p then q If my car has a bad engine, p→q
then my car has a bad carburetor
 p = premises , hypothesis
 q = consequence, conclusions
BICONDITIONAL
 Connects propositions with IFF
 We use the symbol ↔
Example:
My car has a bad engine. p

My car has a bad carburetor. q

My car has a bad engine if and only if my car has a


p↔q
bad carburetor
RECALL

1. p v q or DISJUNCTION
2. p → q If…then IMPLICATION/ CONDITIONAL STATEMENT
3. p ^ q and CONJUNCTION

4. p ↔ q Iff BICONDITIONAL

p Not NEGATION
TOPIC 4

QUANTIFIERS
QUANTIFIERS
 Quantifiers are words, expressions, or phrases that indicate the
number of elements that a statement pertains to.
 In mathematical logic, there are two quantifiers: 'there exists'
and 'for all.
QUANTIFIERS
EXISTENTIAL QUANTIFIES UNIVERSAL QUANTIFIES

 Not all elements satisfy the  all elements satisfy the


given property given property
 “there exists”  “for all”
 “at least one”  “for every”
∃ ∄ ∀
EXAMPLE

𝟏.𝒙=−𝟐,−𝟏,𝟎,𝟏,𝟐,𝟑,𝟒,𝟓,𝟔
∀ x∈ℤ {−𝟐, −𝟏, 𝟎, 𝟏,𝟐, 𝟑, 𝟒, 𝟓 ,𝟔}

∃ x ∈ℤ − {−𝟐, −𝟏}

∃ x ∈ set of even numbers {−𝟐,𝟎, 𝟐, 𝟒,𝟔}

You might also like