Module 5

Elementary logic , c0nnectives ,quantifiers’, negation , variables

A. Introduction :

The field of mathematical logic—evolving around the notions of logical validity, provability, and
computation—was created in the first half of the previous century by a cohort of brilliant
mathematicians and philosophers such as Frege, Hilbert, Gödel, Turing, Tarski, Malcev, Gentzen, and
some others. The development of this discipline is arguably among the highest achievements of science
in the twentieth century: it expanded mathematics into a novel area of applications, subjected logical
reasoning and computability to rigorous analysis, and eventually led to the creation of computers.

B. Objectives:

After going through this module, you are expected to;

1. Write statements in symbolic forms.

2. Write symbolic statements in words.
3. Construct a truth table for a given compound statement.
4. Use truth table for logical equivalence.
5. Write conditional statement in other forms.

C. Learning Content: Elementary Logic , Connectives , Quantifiers , Negation , Variable

D. Pre-Test

Direction:

Part I : Choose the letter of the best answer. Write your letter of choice in a separate sheet of
paper.

1. Which of the following statement is a proposition?

a. Get me a glass of milkshake c. What is the time now?
b. God bless you d. The only odd prime number is 2
2. Let P: This is a great website, Q. You should not come back here. Then ‘This is a great website
and you should come cack here is best represented by?
a. ~ P V ~ Q b. P ˄ ~ Q c. P ˅ Q d. P ˄ Q
4. Suppose p is the statement 'There are 1,000 met 3. Let P: We should be honest., Q: We should
be dedicated.,R: We should be overconfident. Then ‘We should be honest or dedicated but not
overconfident.’ Is best represented by ?
 a. ~P V ~Q V R b. P ∧ ~Q ∧ R c. P V Q ∧ R d. P V Q ∧ ~R
5.Suppose p is the statement 'There are 1,000 meters in one kilometer' and q is the statement 'You
will order a burrito.' Select the correct symbolization for the statement 'There are not 1,000
meters in one kilometer and you won't order a burrito'.
a. ~p∧~q b. ~(p∧q) c. ~ p∨~q d. None of these
6. Which of the following is a solved conjecture?
a. ∀ m ∈ N , ∃ n ≥ m, n odd, ∃ p, q ∈ P, n = p + q
b. ∀ m ∈ N , ∃ n ≥ m, n ∈ P and n + 2 ∈ P
c. ∀ m ∈ N , ∃ n ≥ m, 2 2 n + 1 ∈ P
d. ∀k ∈ N , ∃ p ∈ P, p ≥ k , 2 p − 1 ∈ P

7. The statement form (p ⇔ r) ⇒ (q ⇔ r) is equivalent to

a. ∼[(∼p ∨ r) ∧ (p ∨ ∼r)] ∨ [(∼q ∨ r) ∧ (q ∨ ∼r)]
b. [(∼p ∨ r) ∧ (p ∨ ∼r)] ∨ ∼[(∼q ∨ r) ∧ (q ∨ ∼r)]
c. ∼[(∼p ∨ r) ∧ (p ∨ ∼r)] ∧ [(∼q ∨ r) ∧ (q ∨ ∼r)]
d. [(∼p ∨ r) ∧ (p ∨ ∼r)] ∧ [(∼q ∨ r) ∧ (q ∨ ∼r)]
8. Translate ∀ x ∃ y( x < y) in English, considering domain as a real number for both the
variable.
a. For all real number x there exists a real number y such that x is less than y
b. For every real number y there exists a real number x such that x is less than y
c. For some real number x there exists a real number y such that x is less than y
d. For each and every real number x and y such that x is less than y
9.

1. Propositional logic uses symbols to stand for statements and...

a. Non statements

b. The relationships between subject and predicate

c. Truth values

d. The relationships between statements

10. The symbolization for a conjunction is...

a. p → q b. p & q c. p v q d. ~ p

11. In a disjunction, even if one of the statements is false, the whole disjunction is still...

a. False b. Negated c. True d. Both true and false

12. In a conditional statement, the first part is the antecedent and the second part is the...

a. Predicate b. Consequent c. Subject d. Disjunct

13. Which of the following is not true about universal quantifiers?

a. The phrase that indicates a universal quantifier is 'for all.'

b. The symbol we use for a universal quantifier is ∀.
c. The elements of a given set satisfy a property.
d. The symbol we use for a universal quantifier is ∃.

14. Which of the following statement is true about existential quantifiers?

a. The symbol we use for existential quantifiers is ∃.

b. A property is true for all of the elements in a set.
c. The phrase we use for existential quantifiers is 'for all.'
d. The symbol we use for existential quantifiers is ∀.

15. The name of the following argument form is... p → q ~ p ∴ ~ q

a. Denying the consequent b. Disjunctive syllogism c. Modus tollens d. Denying the antecedent

16. In a truth table for a two-variable argument, the first guide column has the following truth
values:

a. T, T, F, F b. F, F, T, T c. T, F, T, F d. d. T, F, F, F

17. In using the short method, your overall goal is to see if you can...

a. Show that all the statements of the argument are true

b. Prove invalidity in the most efficient way possible
c. Prove validity in the most efficient way possible
d. Prove that the conclusion is false

18. The four logical connectives are…

a. Conjunctions, conditionals, compounds, and disjunctions

b. Conjunctions, statements, disjuncts, and conditionals
c. Conditionals, disjunctions, negations, and conjunctions
d. Conjuncts, disjuncts, conditionals, and negations

19. A conditional is symbolized like this…

a. p v q b. p → q c. p * q d. p & q

20. A conditional is false only when the antecedent is…

a. True and the consequent is false

b. False and the consequent is false
c. True and the consequent is true
d. False and the consequent is true
Learning Activity :

Mathematical Logic

This lesson deals with the relationship between the natural language and the mathematical
language using symbols and variables.

Symbolic logic is a powerful tool for analysis and communication in mathematics. It represents the
natural language and mathematical language with symbols and variables. The main parts of
symbolic logic are statements and connectives. The following table shows some basic
propositional logic with their symbols.

Propositional logic is the fragment of logic where new statements are built from given statements using
so-called connectives like “not”, “or” and “and”. The truth value of such a new statement is then
completely determined by the truth values of the given statements. Thus, given any statements p and q,
we can form the three statements

¬p (the negation of p, pronounced as “not p”),

p ∨ q (the disjunction of p and q, pronounced as “p or q”),

p ∧ q (the conjunction of p and q, pronounced as “p and q”)

statements and connectives. The following table shows some basic propositional logic with their
symbols.

Connectives Propositional Symbols Example Read

Logic

Not Negation Not p ( p is false )

~ ~p
p and q
( both p and q are true )
And/But conjunction p ^q
^

p or q (Either p is true or
q is true or both are true )
Or disjunction p ˅q
˅
If p then q
 Implies conditional p → q
→
P implies q and q
implies p
If and only if biconditional
↔ p ↔ q
P if and only if q

A statement is an assertion which can be regarded as true or false.

A simple statement is a single statement which does not contain other statements as parts.
A compound statement contains two or more statements.
A logical connective combine simple statement into compound statements.

Example 1.) The following sentences are simple statements.

I will go to mall;
The sky is cloudy;
You will receive your promotion;
The function f ( x ) is continuous.

Example 2.) Consider the following statements.

Harry is not happy

Harry is going to watch a volleyball game.
It is going to rain.
Today is Sunday.
Write the following compound statements in symbolic form.

a. Today is Sunday and harry is not happy.

b. Today is Sunday and Harry is not going to watch a volleyball game.
c. If it is going to rain , then Harry is not going to watch a volleyball game.
d. Harry is going to watch a volleyball game if and only if he is happy.
e. Harry is not happy only if it is not going to rain.
f. Harry is going to watch a volleyball game or it is going to rain.

Solution : a.) S ^ ~ h ,
b.) S ^ ~ v
c.) ~ r →~ v
d.) v ↔h
e.) ~ h ↔~r
f.) v ˅ r

Exercises 1-A :
Convert the following symbolic statements into words given the following propositions.
p : Gian plays volleyball.
 q : Lanz plays basketball
a.) ~p
b.) P^q
c.) p →~q
d.) p˅( ~p→q)

Exercises 2- A : Consider the following statements .

p : Adela is a singer.
q : Adele is a songwriter.
r : Adele is an actress.

a. Write ( p^q) → ~r into words.

b. Write in symbolic form the following statement.
“ If Adele is an actress , then Adele is not a singer and Adele is not a songwriter”

Truth Table
A logical statement may either be true or false. If the statement is true , we say that the
truth value corresponding to the statement is true and is denoted by the letter T. If it is false ,
the statement has a value denoted by F. The truth table is a summary of all possible truth values
of a statement.

Here are some examples.

a.) Assertion
P

b.) Negation
p ~p

T F

F T

c.) Conjunction
p q P^q

T T T
 T F F

F T F

F F F

d.) Disjunction
P q p˅q

T T T

T F T

F T T

F F F

e.) Conditional
P q p→q

T T T

T F F

F T T

F F T

f.) Biconditional
P q p↔q

T T T

T F F

F T F

F F T

An easy way to construct the truth table is to assign a value “ 1 “ to the true value and a value
“ 0 “ to the false value. The connective is equivalent to multiplication while the symbol is
equivalent to addition. Note that “ 1 + 1 = 1 “.

Example 3. Construct the truth table for the compound statement.

 (p˅q)^~p

Solution : Apply the basic rules , we obtain the following

p q p˅q ~p (p˅q) ^ ~ P

T T T F F

T F T F F

F T T T T

F F F T F

Logical Equivalence
Two mathematical statements are logically equivalent if the final output of their truth tables are
recently alike.

Example 4. Verify that the statements p → q and ~p ˅ q are logically equivalent. What is the
logical content equivalent of “ if the price is right then I will accept the job offer”

Solution: We construct the truth table to show equivalence

p q ~p p→q
~p v ‫؞‬
p→q ~p ˅ q

T T F T T

T F F F F

F T T T T

F F T T T

Since the last two columns are identical , the given statements are logically equivalent.

Using the above results , the logical content equivalent of “ If the price is right then I will accept
the job offer” is “ The price is not right or I will accept the job offer”.

Example 5. Given , s : A polygon has three sides.

t : A polygon is a triangle
 Write the given statement in symbolic form.
“ A polygon having three sides is a necessary and sufficient condition for a polygon to be a
triangle”

Solution : s ↔ t

The Converse , the Inverse , and the Contrapositive

The conditional statement p( antecendent ) → q ( consequent ) has the following forms.

a.) If p , then q.
b.) P implies q.
c.) P only if q.
d.) Not p or q .
e.) Every p is q.
f.) q , if p
g.) q provided that p
h.) q is a necessary condition for p.
i.) p is a sufficient condition for q.

Example 6. Write the converse , inverse , and contrapositive of

If I get the job, then I will rent the apartment.

Solution:

Converse : If I rent the apartment , then I get the job.

Inverse : If I do not get the job, then I will not rent the apartment.

Contrapositive : If I do not rent the apartment, then I did not get the job.

Example 7. Consider the following statements.

p : x is a prime number
q : x is odd.
Formalize the following statements.

a. x being prime is a sufficient condition for being odd.

b. x being odd is a necessary condition for being prime.
Solution
a. p →q
b. q→ p
Example 8. Write each statement in the form “ If p , then q”.

a. I will be able to tour abroad next year provided have my passport renewed.
b. Every triangle that is not a right triangle then it is an oblique triangle.
Solution:
a. If I have my passport renewed then I will be able to tour abroad next year.
b. If a triangle is not a right triangle then it is an oblique triangle.

If the conditional statement is given by p → q then the following are three related
statements.

Converse : q → p
Inverse : ~p → ~q
Contrapositive : ~q → ~p

Exercises 3 – A . : Write the converse , inverse , and contrapositive of the given sentence.
“ She is allowed to join the volleyball team , only if she knows how receive the ball.

Exercises 4 – A . : Write the converse , inverse , and contrapositive of the given sentence.
“ Every rectangle is a parallelogram”

Assessment:

Formalize the given statement using the following propositions.

p : Paul is happy.
q : Queenie is happy
r : Paul play the guitar
1. Both Paul and Queenie are happy . ______________
2. Paul plays the guitar provided that he is happy ._________
3. If Paul is happy and play the guitar then Queenie is not happy . ___________

Part II : Let M : Mark is English and L : Lem is German . Translate the following logic symbols in
words.
1. M ˅ L ____________________________
2. ~L _______________________________
3. M →~L _____________________________
4. M ^ ( ~ L ) ___________________________
5. M ˅ ( ~ M → L ) _______________________

Part III : Construct truth tables for the given compound statement.
1. p ^ ( ~ q )
2. [ p ^ ( ~ q ) ] ˅ [ ( ~ p ) ˅ q ]
3. ~ ( p ˅ ~ q ) ˅ p
Part IV : p is false and q is true , what are the truth values of the given statements ?
1. ( p ˅ q )
2. ( ~ p ) ^ ( ~ q )

Part V : Write the converse , inverse and contrapositive of the given statement. Use the
contrapositive to determine whether the original statement is true . Note : if the contrapositive
statement is true , the original statement is also true.

a. If a quadrant is not a rectangle then is not a square .

Converse:
_________________________________________________________________________
Inverse :
_________________________________________________________________________
Contrapositive :
____________________________________________________________________
True or False :
_____________________________________________________________________

b. If yesterday is not Wednesday , then tomorrow is not Friday .

Converse:
_________________________________________________________________________
Inverse :
_________________________________________________________________________
Contrapositive :
____________________________________________________________________
True or False :
_____________________________________________________________________