Module 5 Introduction To Logic
Module 5 Introduction To Logic
Module 5 Introduction To Logic
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
LOGICAL CONNECTORS
● Negation
- The negation of a proposition p, is denoted by ~p: (read as ‘not’ p) and is defined through the
truth table:
● Conjunction
- The conjunction of a preposition p, is denoted by p^q: (read as p and q) and is defined through
the truth table:
● 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.
● 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.