Mathematical Logic

Logic is the formal systematic study of the principles of valid inference and correct reasoning.
Logic examines:
- General forms which arguments may take
- Which forms are valid and fallacies

The initial motivation for the study of logic was to learn to distinguish good arguments from bad
arguments.

Logical Connectives and Symbols

A. Negation
- This indicates the opposite of the proposition p and denoted by the symbol ~p
p ~p
True False
False True

B. Conjunction
- Formed by joining two propositions p and q with the word “and”. It is denoted by p Λ q (p and q)
p q pΛq
True True True
True False False
False True False
False False False

C. Disjunction
- Formed by joining two propositions p and q with the word “or” denoted by p V q (p or q)
p q pΛq
True True True
True False True
False True True
False False False
Activity
If p represent the statement 4 > 1, and q represent the statement 12 < 9, and r represent 0 < 1, decide
whether the statement is true or false. ( ̴ p ˄ r) ˅ ( ̴ q ˄ p)
p q r ~p ~q ~r ~p Λ r ~q Λ r V
True True True False False False False False False
True True False False False True False False False
True False True False True False False True True
True False False False True True False True True
False True True True False False True False True
False True False True False True False False False
False False True True True False True False True
False False False True True True False False False
Conditional Statement
- statement is a compound statement that uses the connective if…then
- The conditional is written with an arrow, so “if p then q” is symbolized p  q
- The conditional is read as “p implies q” or if p then q”
- The statement p is the antecedent, while q is the consequent
p q pq
True True True
True False False
False True True
False False True

Biconditional statement
- Expressed as p q represents p if and only if q
- Where p is a hypothesis and q is a conclusion

p Q p q
True True True
True False False
False True False
False False True

Conditional Proposition

Quantifiers
a. Existential quantifiers
o Indicates that the statement is true for at least one element denoted by Ǝ
o It uses the words some, for some, there exist and at least one.
If p then q p is sufficient for q
If p, q q is necessary for p
p implies q All p are q
p only if q q if p
 b. Universal quantifiers
o Indicates that the statement is true for all elements denoted by
o It uses the words None or no, all and for every

Negation of quantified statements

Statement Negation
All x are y Some x are not y
No x are y Some x are Y
Some x are not y All x are y
Some x are y No x are y

Symbolic Logic Applications

Switching network an arrangement of wires and switches that connects two terminals
- A closed switch permits the flow of current
- An open switch prevents the flow of current.

An analogy exist between a network P and a statement p since a network is either open or close while a
statement p is either true or false

- Series involves two switches p and q connected in a chain (p Λ q)

- Parallel network involves two switches P or Q is closed denoted by p V q

- Complex network
o A combination of series and parallel
o This complex network is closed, provided P or Q is closed or whenever both R and ~p are
closed