Mathematics as a Language

● Mathematical Language (Algebra)

● Symbols:
○ English Letters / Arabic Numerals
○ Variables and Constants
● Term
○ Algebraic Expressions
● Mathematical statements: Equations, Inequalities, etc

Propositional Calculus
● A proposition is a complete declarative sentence that is either true or false, but not
both.
○ Example: There are 4 sections of GEMATH attending today's master class.
(FALSE) [master class only consist of one section]
 ● Propositions are usually denoted by capital letters of the English alphabet
○ P, Q, R, S (usually used)
● If a proposition P is true, its truth value is true, and is usually donated by T
● If it is false, its truth value is false denoted by F.

Connectives and compound propositions

● A propositional connective is an operation that combines two propositions to yield a
new proposition whose truth value depends only on the truth value of the two original
propositions.
● Combinations of propositions using propositional connectives are called compound
propositions.
If propositions have their truth values, what is the truth value of a compound proposition?

Conjunction of propositions
● The proposition “P and Q”, denoted by P ⋀ Q is called the conjunction of P and Q.
Disjunction: Inclusive “or”
● This is denoted by v
● P v Q - “P or Q” (inclusive)
○ Example: I will go to DLSU today or I will meet with my friends (TRUE)
■ [if at least one statement is satisfied]
■ [Will only be false if both statements are false]

Disjunction: Exclusive “or”

● This is denoted by ⊕
○ Example: I will go to DLSU today or I will meet with my friends
■ [False if both statements are true]
■ [False if both statements are false]
■ [Excluding the possibility that both statements are true or false]

Implications or Conditionals
● The proposition “If P, then Q” is denoted by ⇒
● P is hypothesis (premise) and Q is conclusion
○ Example: If today is Sunday, then I will go to mass at 4 pm
■ [The conclusion does not matter as long as the premise is false]
■ [If P is false, statement is true if Q is true]
■ [If P is true, statement is true]
■ [The only possible false conclusion is if P is true and Q is false]
● Related Implications:
○ Converse, Contrapositive, Inverse

Biconditionals
● The proposition “P if and only if Q” is denoted by P⇔Q
● If P and Q are true, then it is true, if P and Q are false, then it is true.
○ If one statement is different from the other, then it is false.
Tips in Constructing Truth Tables

If 3 propositions are given then it is equal to 8 rows - 2^3 = 8

 T and T = T T implies T = T
T and F = F T implies F = F
F and T = F F implies T = T
F and F = F F implies F = T

T or T = T T if and only if T = T
T or F = T T if and only if F = F
F or T = T F if and only if T = F
F or F = F F if and only if F = T

A contingent compound proposition is one that is neither always true (like a tautology) nor
always false (like a contradiction). Instead, a contingent proposition's truth value depends on the
specific truth values assigned to its individual components or variables. In other words, a
contingent proposition can be true in some circumstances and false in others, depending on the
values of its component propositions.
Identity Laws
● T is a proposition that means that it has a result of Tautology (ALL ARE TRUE)
○ Example below
Do the ones inside the parentheses first, then follow the rest. Always remember the sequence of
computing

Deductive Argument

Valid and Invalid Arguments

● Valid if whenever all the premises are true, then the conclusion is also true.
● Otherwise it is invalid
● If you only have 1 premise, then you can add q in the conclusion
○ Q is any proposition
● A - Addition
●