Module 5 Introduction To Logic

Download as pdf or txt
Download as pdf or txt
You are on page 1of 4

MODULE 5

LOGICAL CONNECTORS

WHAT IS LOGIC?
- Logic is an interdisciplinary field which studies truth and reasoning. Informal logic seeks to characterize
valid arguments informally. Formal logic represents statements and argument patterns symbolically, using
formal systems such as order and logic. (Wikipedia)
- Logic is the science of correct reasoning.

USES OF LOGIC
● Lawyers and Judges - communicate effectively, construct valid arguments, analyze legal contracts,
make decisions
● Programmers - design computer software and apps
● Electrical Engineers - design circuits for smartphones
● Mathematicians - solve problems, probe theorems

HISTORICAL BACKGROUND
● Pythagoras (584 - 495 BC, Greece) - Philosopher and Mathematician
- “All is number” and Math led to the elevation of the soul
● Socrates (400 BC, Greece) - Philosopher and father of critical thinking
● Gottfried Wilhelm Leibniz (1646 - 1716, Germany) - Combining logic and Math can create symbolic
language that can solve scientific problems
● Augustus de Morgan (1806 - 1871, India) - viewed Math as an abstract study of symbols
● George Boole (1815 - 1864, England) - Father of symbolic logic
● Charles Lutwidge Dodgson (1832 - 1898, England) - known as Lewis Caroll (nonsensical classics Alice's
Adventures in Wonderland and Through the Looking Glass); the Game of Logic and Symbolic Logic

SIMPLE AND COMPOUND SENTENCES


● Simple statement - a statement that conveys a single idea
○ Examples:
- Two is an even number.
- Two is a prime number.

● Compound statement - a statement that expresses two or more ideas


○ Examples:
- Two is an even prime number.
- I will study GE Math I or I will fail in this subject.

TRUTH VALUE AND TRUTH TABLES


● The truth value of a simple statement is either true (T) of false (F).
● The truth value of a compound statement depends on the truth values of its simple statements and its
connectives.
● The truth table is a table that shows the truth value of a compound statement for all possible truth values
of its simple statements.

LOGICAL CONNECTORS
● Negation
- The negation of a proposition p, is denoted by ~p: (read as ‘not’ p) and is defined through the
truth table:

○ Write the negation of the statement.


p1: 2 is an odd number.
p2: The dog does not need to be fed.
p3: The tinikling is the most difficult dance.
Solution:
~p1: 2 is an even number or 2 is not an odd number.
~p2: The dog needs to be fed.
~p3: The tinikling is not the most difficult dance.

● Conjunction
- The conjunction of a preposition p, is denoted by p^q: (read as p and q) and is defined through
the truth table:

○ Let p and q be the following propositions.


p: Today is Friday.
q: It is raining.
Write the following conjunction as English sentences
a. p^q → Today is Friday and it is raining.
b. p^(~q) → Today is Friday and it is not raining.
● Disjunction
- The disjunction of a proposition p and q, is denoted by p v q: (read as p or q) and is defined
through the truth table:
- The truth table tells us that the disjunction p v q is false only when both disjunction p and q are
false.

○ Let p,q and r be the following propositions


p: Enrique has a date with Liza.
q: James is sleeping.
r: Daniel is eating.
Express the following propositions in English sentences or in symbols, as the case may be.
a. p v q → Enrique has a date with Liza or James is sleeping.
b. q v (~r) → James is sleeping or Daniel is not eating.
c. p v (q v r) → Enrique has a date with Liza, or James is sleeping or Daniel is eating.
d. Either Enrique has a date with Liza or James is sleeping, or Daniel is eating.
→ (p v q) v r
e. Either Enrique has a date with Liza, or James is sleeping and Daniel is eating.
→ p v (q^r)

● Conditional
- The conditional of a proposition p and q, is denoted by p → q: (read as if
p, then q) and is defined through the truth table:
- The conditional p → q may also be read as ‘p implies q’.
- Proposition p is called the hypothesis
- Proposition q is called the proposition.

○ Suppose that Kyle is a Grade 12 student. Consider the ff. conditions.


p1: If Kyle is in Grade 12, then he is a senior high school student.
p2: If Kyle is in Grade 12, then he is working as an engineer.
p3: If Kyle has a degree in tourism, then he believes in true love.
Analyze the truth values of these conditionals.
p1 is true, as the first row of the truth table asserts.
p2 is false, as the first row of the truth table indicates.
p3 is true regardless of the truth value of its conclusion as shown in the last two rows of the
truth table.

● Biconditional
- The biconditional of a proposition of p and q, is denoted by p ↔ q: (read as if p and only if p) and
is defined through the truth table:
- The biconditional may also be written as ‘p if q’.
- Proposition p and q are the components of the biconditional.

○ Suppose that Kyle is a Grade 12 student. Consider the ff. conditions.


p1: If Kyle is in Grade 12, then he is a senior high school student.
p2: If Kyle is in Grade 12, then he is working as an engineer.
p3: If Kyle has a degree in tourism, then he believes in true love.
Analyze the truth values of these conditionals.
p1: both components of p1 are true, hence the biconditional is true according to the first
row of the truth table.
p2: the biconditional is false, as the second row of the truth table indicates.
p3: the biconditional is false.

SUMMARY OF THE TRUTH TABLE SUMMARY OF LOGICAL CONNECTORS

You might also like