Scribd
Upload
97 views34 pages

Chapter 2 Lesson 2

- Logic is the study of correct and incorrect reasoning. It involves connectives, variables, quantifiers, and negations which are essential to symbolic logic. - Compound statements use connectives like 'and', 'or', 'if...then', 'if and only if' to join simple statements. Quantifiers emphasize or deny the existence of something. - Negating a quantified statement reverses whether it emphasizes or denies existence. For example, the negation of 'All students passed the exam' is 'Some students did not pass the exam'.

Uploaded by

Albert L. Academia
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
97 views34 pages

Chapter 2 Lesson 2

- Logic is the study of correct and incorrect reasoning. It involves connectives, variables, quantifiers, and negations which are essential to symbolic logic. - Compound statements use connectives like 'and', 'or', 'if...then', 'if and only if' to join simple statements. Quantifiers emphasize or deny the existence of something. - Negating a quantified statement reverses whether it emphasizes or denies existence. For example, the negation of 'All students passed the exam' is 'Some students did not pass the exam'.

Uploaded by

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

LESSON 2

ELEMENTARY LOGIC:
Connectives, Variables, Quantifiers,
and Negations
Objectives:

• Define simple statement and compound statement.


• Write compound statements using connectives.
• Express simple and compound statements symbolically.
• Write the negation of a qualified statement.
INTRODUCTION
Logic is the study of the methods and principles used to
discriminate correct from incorrect reasoning. As tertiary
students, you must know how to reason out logically and test
the validity of an argument about any matter. You will learn
about connectives, quantifiers, negations, and variables which
are essentials to modern logic and its symbolic language. There
is a separate chapter for other topics under Logic.
Connectives
A declarative sentence is a sentence whose main verb is indicative. A
statement is a declarative sentence that is either true or false but can
not be both. a statement can be simple or compound. Below are
examples of simple and compound statements.

Simple Statement Compound Statement

The highest mountain in the Philippines is The highest mountain in the Philippines is
Mt. Apo. Mt. Apo, and the second highest mountai
n is Mt. Pulag.

Cebu is the oldest City in the Philippines. We will go to Camiguin island or we will go
to Mactan island.
To create a compound statement, connectives like and, or, i
f ... then, and if and only if are used.

Connective Symbols Type of Statement

and ^ Conjunction

or v Disjunction

if. .... then Conditional

if and only if Biconditional


The first example of compound statement which is "The highest mountain
in the Philippines is Mt. Apo, and the second highest mountain is Mt. Pulag
" may be written using the following symbols.

Statement Symbol

The highest mountain in the P p


hilippines is Mt. Apo.
The second highest mountain i q
s Mt. Pulag.
The highest mountain in the P p^q
hilippines is Mt. Apo, and the s
econd highest mountain is Mt.
Pulag.
Write the second example of compound statement which is " We will go
to Camiguin island or we will go to Mactan island" using symbols.

Statement Symbol
Activity (Collaboration)
and
Analysis (Communication)
Write five examples of simple statements and five examples of compoun
d statements about the Philippines. These can be trivia or recent news. P
resent your work to the class.

Simple Statement Compound Statement


Abstraction
(Critical Thinking)
Write the compound statements on the activity using
the correct symbols.

Compound Statement Symbols


Quantifiers and
Negations
"All freshmen students are graduates of the K-12 curriculum" is a
qualified statement which is a statement containing quantifiers.
The words like "all", there exists" and "none" are examples of qua
ntifiers. Existential quantifiers like "there exists" and "at least one
" are used to emphasize the existence of something. Words like "
none" and "no" deny the existence of something, and words like
"all" and "every" stress out that every elements satisfies a
condition. These words are called universal quantifiers.
Every variable in a mathematical statement has a corresponding quantifier.
The quantifiers are "for all" and "there exists". The phrases like "for all x in
R" or " for every x in R such that" is written as

The negation of the statement "All freshmen students are graduates of the
K-12 curriculum" is "Some freshmen students are not graduates of the K-12
curriculum".
Quantified Statement Negation

No Y are Z. Some Y are Z.

Some Y are Z. No Y are Z.

Some Y are not Z. All Y are Z.

All Y are Z. Some Y are not Z.


Write the negation of each of the following statements:
1. All school gates are open.
Negation: ________________________________________
2. Some drinks in the school canteen are espresso-based.
Negation: ________________________________________
3. No students are wearing their uniforms.
Negation: _______________________________________
Application
(Creativity)
Write 5 quantified statements together with its negation regarding
the latest news/issue/trends in our countries.

Quantified Statement Negation


SUMMARY
• The study of the methods and principles used to discriminate correct
from incorrect reasoning is called logic.
• Compound statements have connectives like and, or, if... then, and if
and only if.

Connective Symbols Type of Statement


and ^ Conjunction
or v Disjunction
if. .... then Conditional
if and only if Biconditional
• To emphasize the existence of something, existential quantifiers like
"there exists" and "at least one" are used. Universal quantifiers are
Words like "none" and "no" which deny the existence of something,
and words like "all" and "every“ point out that every element
satisfies a condition.
Quantified Statement Negation
No Y are Z. Some Y are Z.
Some Y are Z. No Y are Z.

Some Y are not Z. All Y are Z.


All Y are Z. Some Y are not Z.

• The quantifier "for all" or "for every" is represented by the symbol.


Chapter
Summary
• Precise, concise, and powerful are characteristics of the language of
mathematics: precise, concise, and powerful.
• The collection of any object is called set.
• A set is a subset of a given set if any one of the following three
• conditions holds:
• - It is the given set.
• - It is the empty set, or
• - Each member of the set is also an element of the given set.
• A relation is a set of ordered pairs. A function is a relation
in which the element of the first set (domain) corresponds
to only one element of the second set (range).

• A binary operation is used to merge two values to generate


a new one.
Chapter
Assessment
Write the letter of your choice on the blank provided before each
number.

_____ 1. It refers to a well-defined collection of objects.

A. Element
B. Member
C. Set
D. Universe
_____ 2. A set whose elements are limited and the last element can be
identified as ______ set.
A. a finite
B. a unit
C. a universal
D. an empty
_____ 3. What do you call a set with no elements?
A. Empty
B. Finite
C. Unit
D . Universal
For numbers 4 to 10, identify the property involved on each equation.

A. Associative Property
B. Closure Property
C. Identity Property
D. Inverse Property
4.) 3 + 2 = 5
5.) √2 (2) = 2 √2
6.) 3 + (x + y) = (3 + x) + y
7.) ½ + 0 = ½
8.) -5 + 5 = 0
9.) 0 + 58.7 = 58.7
10.) -3/5 x 5/3 + 1
For numbers 11 to 25, write the correct symbol.

Word/Phrase Symbol
11. and
12. for all
13. the set of real numbers
14. an element of the set of inte
gers
15. a member of the set of real
numbers
16. or
17. If ...then
18. for some
19. If and only if
20. the set of irrational numbers
21. for every
22. the set of natural numbers
23. an element of set A = {..., -3, -2,
-1, 0, 1, 2, 3, ...}
24. a simple statement
25. an element of set
H = { -12.356,

You might also like