Professional Documents
Culture Documents
1|Page
Elementary Logic: Connectives, Quantifiers, Negations, Variables
Overview
WHAT IS LOGIC?
. Learning Outcomes
From our previous modules, we learned that mathematics is a language. And being a language, it must be
communicated with great precision and reasoning ability. To achieve these, logic is the key.
In layman ’s term, logic concerns much on correct reasoning, especially in
making inferences/conclusions/judgments. Logic began as a philosophical term and is now used in other
disciplines like math, science, and computer science. In short, it is deeply rooted in Philosophy.
Discussion
Logic serves as a set of rules that govern the structure and presentation of mathematical
evidence/proofs. These rules are being used to make a distinction between valid and invalid mathematical
reasons/arguments. The building blocks of logical arguments are logical statements.
2|Page
LOGICAL STATEMENT OR PROPOSITION
- a declarative sentence which conveys information
- a sentence which states or asserts something.
If the sentence is true, the statement has truth value T(TRUE), otherwise it has a truth
value F(FALSE).
Examples:
1. Legazpi City is the capital of Albay in Bicol.
• This proposition has a truth value of T.
2. The Earth is the center of the solar system. •
This truth value of this proposition is F.
3. 5 + 5 = 10
• The proposition is true, therefore, its truth value is T.
4. 6 × 1 ≥ 9
• The truth value of this proposition is F.
5. Are you asleep?
• This is not a proposition. (Based on the definition of logic, a proposition is
a declarative sentence.)
6. Turn off the switches.
• This is also not a proposition. (This is an imperative sentence which
conveys command or request.)
3|Page
Negation
The statement obtained from 𝒑 by use of the word “not” is called the
negation of 𝒑 and is written ∼ 𝒑. The truth value is the opposite of the
truth value of p.
Examples:
• 𝒑: 2 is odd. (The truth value is FALSE)
∼ 𝒑: 2 is not odd. (The truth value is the opposite of 𝒑. Therefore, the
truth value of ∼ 𝒑 is TRUE.)
Note: We can also say ∼ 𝒑: It is not the case that 2 is odd.
• 𝒑: Japan is not in Asia. (This is a FALSE statement) ∼ 𝒑:
Japan is in Asia. (This is a TRUE statement.)
4|Page
NOTE: The logical notation for the connectives “and”, “or”
and “not” is not standardized. In some references: p ∧ q
can be written as p & q, p • q or pq p ∨ q can be written
as p + q
∼p can be written as p’, p or ⇁p
When a logical statement is used to refer about a collection of objects, the statement must be
quantified—that is, we must specify which objects in the collection the statement applies to.
Quantifiers
Examples:
• Some people believe in miracles.
• There exists an integer, such that 5 − 𝑥 = 2.
We can also identify the truth value of quantified statements. Let’s consider the following
examples.
• All people are female. (This statement uses universal quantifier and has a truth value of
FALSE, since there are male people in the world.)
• Some people are female. (This statement uses existential quantifier, and the truth value is
TRUE.)
Negation of Quantified
Statements
EXAMPLES:
• All artists are singers. (This is FALSE) Some
artists are not singers. (This is TRUE)
• There exists a happy man. (This is TRUE)
All men are unhappy. (This is FALSE)
5|Page
Summary/Key
Points
A proposition or statement is a declarative sentence that is either true or false. If it conveys one
idea, it is a simple proposition. If two propositions are combined using connectives, a compound
proposition is generated. There are three basic logical connectives or operators: conjunction, disjunction
and negation. A compound proposition, connected by a conjunction, has a truth value of true if the
statements involved are true, otherwise, false. A compound proposition, connected by a disjunction, has a
truth value of true if at least one of the statements involved is true. The negation of a statement has a truth
value opposite the truth value of the original statement. Statements can be quantified using quantifiers:
universal quantifier (all the elements of a given set satisfy a property) and existential quantifier (at least
one element exists that satisfies a certain property). Quantified statements can be negated. The negation
of ‘for all’ statement is a ‘some’ statement and the negation of a ‘some’ statement is a ‘for all’ statement.
Assessment
References
Retrieved from:
http://www.math.niu.edu/~richard/Math101/logic.pdf https://examples.yourdictionary.com/examples-of-
logic.html http://www.math.wichita.edu/history/Topics/logic.html
https://www.geeksforgeeks.org/proposition-logic/
https://www.math.fsu.edu/~wooland/hm2ed/Part2Module1/Part2Module1.pdf http://www-
math.ucdenver.edu/~wcherowi/courses/m3000/lecture2.pdf
6|Page
7|Page