PURE MATHEMATICS PRESENTATION

REASONING AND LOGIC

GROUP MEMBERS
ORWIN AUSTIN
HADIYA VICTORINE
ALTHEA WILLIAMS
GAVEN HOUSTON
MARK HENRY
SHEMROY CAPLE
CRYSTAL DEFREITAS

TOPICS TO BE PRESENTED
- SIMPLE STATEMENTS
- COMPOUND STATEMENTS
- TRUTH TABLES
- CONNECTIVES
- LOGICAL EQUIVALENCE
- IDENTITIES(LAWS) INVOLVING
PROPOSITIONS

SIMPLE STATEMENTS
A simple statement also known as proposition
is a meaningful declarative sentence that is
either true or false.
A statement can be denoted by the letters p,
q or r
For example:
Pure Mathematics is an easy subject.
NOTE: THIS COULD EITHER BE TRUE OR FALSE.

COMPOUND STATEMENTS
A compound statement also known as a
composite statement is composed of
substatements (simple statements) and
connectives.
Example
Pure Mathematics is an easy subject and I will
pass it.
Substatements
- Pure Mathematics is an easy subject.
- I will pass Pure Mathematics.

TRUTH TABLES
A truth table is a table which shows all the
possible combinations of true and false
values for the proposition under analysis.
Example
p

CONNECTIVES

A connective is a symbol which joins two

statements. In this course we will be looking
at the following types of connectives:
Conjunction
Disjunction(inclusive and exclusive)
Negation
Conditional
Bi-conditional

CONJUNCTION
The conjunction of two statements combines
them to form a composite statement using
the word and. This is denoted by the
symbol (^).
The conjunction of two statements is only
true if both statements are true.
The truth table for this using p and q is:

p^q

DISJUNCTION
The disjunction of two statements combines
them to make a composite sentence using the
word or. The symbol (v) is used to denote the
disjunction.
There are two types of disjunction:
Inclusive disjunction
Exclusive disjunction
The distinction between the inclusive and
exclusive disjunction is that with the inclusive
disjunction, the proposition is true if either or
both of the statements are true and the
exclusive is true if only one, but not both of the
statements are true.

DISJUNCTION CONTINUED
The inclusive disjunction has the same symbol
( v ) and the exclusive disjunction has a
symbol ( v ). The truth tables below
represent the values for inclusive and
exclusive disjunction respectively considering
the statements p and q.
p

pvq

pvq

NEGATION
The negation of a statement changes the
truth value of that statement. The symbol
for this is ( ~ )
Example: The statement p says Miss Cave is
beautiful.
However if you negate p, i.e. ~p, this
statement would be Miss Cave is not
beautiful. NO OFFENSE MISS!!!
The truth table for this would be

~p

CONDITIONAL
A conditional statement is one in which the result is
true under some condition. It comes in the form
If, then .
The symbol for this is (
) . The symbol is called
the implication.
Considering the statements p and q the conditional
would be p
q.
Also, p would be called the antecedent and q would
be called the consequent.
The only time when a conditional is false if is the
antecedent is true and the consequent is
false(antecedent and consequent is discussed later).

CONDITIONAL CONTINUED
The truth table to represent such information
would be:
p

Note: The conditional is also known as

implication

BI-CONDITIONAL OR LOGICAL
EQUIVALENCE
When two statements are logically
equivalent, the truth values are the same in
their truth tables. This can be denoted using
the equivalence sign(
).
The truth table for this is as follows:

~q

~(~q)

This table verifies that ~(~q)

IDENTITIES(LAWS) INVOLVING
PROPOSITIONS
LAWS OF THE

ALGEBRA

OF PROPOSITIONS

NAME

CONJUNCTION FORM

DISJUNCTION FORM

Independent laws

p^p=p

p v p =p

Identity laws

p^T=p

pvF=F

Domination laws

p^F=F

pvT=T

Commutative laws

p ^q = q ^ p

pvq=qvp

Associative laws

(p ^ q)^r = p^(q ^ r)

(p v q) v r = p v (q v r)

Distributive laws

p^(q v r) = (p^q) v (p^r)

p v(q^r) = (pvq)^(p v r)

De Morgans laws

~(p ^ q) = ~p v ~q

~(p v q) = ~p ^ ~q

Complement laws
(Negation laws)

p ^ ~p = F
~T = F

p v ~p = T
~F = T

Involution laws (Double

~~p = p
Negation laws)
~(~p) = p

~~p = p
~(~p) = p

Absorption laws

p v (p^q) = p

p ^ (p v q) = p

OTHER TERMS IN LOGICS THAT

YOU SHOULD BE FAMILIAR WITH

Tautology- When a statement have nothing

but truth values in the truth table.
Contradiction- When a statement has
nothing but false values in the truth table.
Contingencies- When a statement has both
true and false values in a truth table.

OTHER TERMS IN LOGICS THAT YOU

SHOULD BE FAMILIAR WITH CONTD
Consider the compound statement p
q
Antecedent- This refers to the first
statement in a conditional.
Consequent- This refers to the second
statement in a conditional.

THANK YOU!!!

REFERENCES
Unit 1 Pure Mathematics for CAPE
By Dipchand Bahaal
Pure Mathematics for Cape Unit 1
By Raymond Toolsie
http://legacy.earlham.edu/~peters/courses/lo
g/loghome.htm
https://youtu.be/OLGVhszBlq4
Wikipedia.com