Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
o Proposition Logic: a branch of symbolic logic dealing with propositions as units and with their
combinations and the connectives that relate them
It is the study of how simple propositions can come together to make more complicated
propositions
Simple Proposition: a proposition that contains one idea only
Compound Proposition: composed of at least two simple propositions joined together by logical
connectives
Logical Connectives
Negation: a unary operator that turns a false proposition to true and the opposite for a
true proposition
Scenario 1: p is true, so ∼p is false
Scenario 2: p is false, so ∼p is true
Conjunction: a binary operator in that it operates two propositions when creating
compound proposition
Other words that can be used in place of the connective “and’ – “but”, “also”,
“moreover”, “while”
For it to be true, both propositions should be true
Disjunction: a binary operator which becomes true when at least one of the components
is true
Other word that can be used in place of the the connective “or” – “unless”
For it to be true, at least one of the propositions should be true
Conditional (Implication): only partly similar/comparable to the English usage of “if,
then”, “implies”, “only if”, or “is sufficient for”
For it to be true, it should follow the convention of: (a) true-true, (b) false-true,
or (c) false-false
Biconditional: for it to be true, the two propositions must have the same truth value;
otherwise, it is false
o Logical Equivalence: two propositions are logically equivalent if they have the same truth tables; denoted
by the symbol “≡”
Rules of Replacement: a statement may be replaced by any statement logically equivalent to it
3. Express the following propositions in symbols, where p, q, r, and s are defined as follows:
p: John is a big eater.
q: Jimmy has a big voice.
r: Joseph likes to travel.
s: Jeffrey likes blue.
a) If John is a big eater or Jimmy has a big voice, then Jeffrey likes blue. _________________________
b) Joseph likes to travel or he does not. _________________________
c) It may or may not be the case that Jeffrey likes blue. _________________________
d) John is a big eater or Jimmy has a big voice if and only if Jeffrey likes
blue and Joseph likes to travel. _________________________
e) While Jimmy has a big voice, John is not a big eater. _________________________
f) Either John is a big eater or Jimmy has a big voice, yet Jeffrey likes blue. _________________________
g) It is not true that John is a big eater and Jeffrey does not like violet. _________________________
REVIEWER IN GENERAL MATHEMATICS
THIRD FINAL EXAMINATION
4. Translate the following statements in symbolic form. Use indicated letters to represent each component proposition.
a) During a Public Storm Warning Signal No. 1 (S), banana trees maybe
tilted (T) or uprooted (U). __________________________
b) The Philippines ranked as 76th freest economy (F) and one of the top
ten most improved economies in the world in the 2015 Index of
Economic Freedom (E). __________________________
c) If a patient come (P), a nurse (N) and a doctor should attend to the
patient (P). __________________________
If p is prime (P), then either p is 2 (T) or p is odd (O). __________________________
5. Find the truth value of the following compound compositions if P, Q, and R are true.
a) P ∧ ∼P ___________________
b) (∼P ∨ Q)↔(P → Q) ___________________
c) (P ∧ ∼Q) → R ___________________
6. Find the truth value of the following compound compositions if P and Q are true, and R is false.
d) ∼P ∧ Q ___________________
e) P ∨ (P ∧ Q) ___________________
f) ∼Q → (P ∧ R) ___________________
g) P ∨ (∼P ∧ R) ___________________
h) ∼Q ↔ (P ∧ R) ___________________
7. Construct a truth table for the following compound propositions. Identify whether it is contradiction, tautology, or
contingency.
a) P ∧ ∼P
b) (∼P ∨ Q) ↔ (P → Q)
c) P ∧ ∼Q → R
REVIEWER IN GENERAL MATHEMATICS
THIRD FINAL EXAMINATION
8. Using a truth table, determine whether the given pairs of propositions are logically equivalent or not.
a) P→Q and ∼Q→P
9. Using rules of replacement, prove that the following propositions are true or equivalent.
a) ∼(P→∼Q) ≡ (P∧Q)
b) P→(Q∧R) ≡ (P→Q)∧(P→R)
REVIEWER IN GENERAL MATHEMATICS
THIRD FINAL EXAMINATION
c) (P∧Q)→P ≡ T [T is true]
e) (∼P→R) ∧ (∼P→∼R) ≡ P
f) (P∧∼Q)∨Q ≡ P∨Q
g) (P∧Q)→(P∨Q) ≡ T [T is true]
REVIEWER IN GENERAL MATHEMATICS
THIRD FINAL EXAMINATION
h) (P→Q)∨(P→R) ≡ P→(Q∨R)