MTH 200 Introduction to Mathematical Logic Winter 2018

Mid- Semester Examination

February 23, 2018

Please use separate sheets of paper to answer the following questions as correctly and neatly as you
can. Max points “ 50.

Problem 1 (5 points). Suppose R1 and R2 are two equivalence relations on a set A. Show that
R1 X R2 is also an equivalence relation on A.

Problem 2 (10 points). Below is a partial truth-table for five wffs α, β, γ, δ, ε Here δ and ε are
only given by their truth tables.

α β γ δ ε
A B A ÐÑ A pA ÝÑ Bq ÝÑ pB ÝÑ Aq p A ^ Bq _ pA _ Bq
T T F F T F T
T F F T T T F
F T F T T T F
F F F F T F T

(i) Fill in the rest of the truth table. (Each connective should have a column of T s and F s below
it.)

(ii) Which of α, β, γ, δ, ε are tautologies?

(iii) Which pairs from α, β, γ, δ, ε are tautologically equivalent?

(iv) Which of the following are true?

α |ù β, β |ù γ, γ |ù δ, δ |ù ε, tδ, εu |ù α

(v) Which of α, β, γ, δ, ε are not satisfiable?

(vi) Which of the following sets are satisfiable?

tα, βu, tβ, γu, tγ, δu, tδ, εu

Problem 3 (5 points). Let Σ be a set of wffs and τ be a wff. Using the definition of |ù, prove the
following.
If Σ Y t τ u |ù K then Σ |ù τ.

(Hints: 1. Recall that for any truth assignment v, we set vpKq “ F . 2. A proof by contradiction
might be easier here.)

Indraprastha Institute of Information Technology - Delhi Page 1

MTH 200 Introduction to Mathematical Logic Winter 2018

Problem 4 (7 points). Let v be a truth assignment such that vpAn q “ T for all sentence symbols
An . Let ϕ be a wff using only the connectives and ÐÑ, and let npϕq denote the number of
occurrences of “ ” in ϕ. Show by induction on the wff ϕ, that vpϕq “ T iff npϕq is even.
(Hints: 1. You must use induction on wffs. You have to consider only two formula building opera-
tors in the induction step, viz., E and EÐÑ , since ϕ contains only these two types of connectives.
2. You can use any standard property of even and odd numbers, such as: an even number plus an
odd number is odd, etc.)

Problem 5 (5 points). Show that t , ÝÑu is a complete set of connectives.

(Hints: You may use the fact that t , _, ^u is a complete set of connectives. You may also use
any tautological equivalence, such as α ÝÑ β |ù) α _ β, without justification.)

Problem 6 (8 points). Find a wff in disjunctive normal form (DNF) that is tautologically equiv-
alent to the wff A ÐÑ pB ÐÑ Cq.

Problem 7 (5 points). Suppose Σ is a set of wffs and τ is a wff.

(a) Show that Σ |ù τ if and only if Σ Y t τ u is not satisfiable.

(b) State the Compactness theorem.

(c) Use the above results to prove the following.

If Σ |ù τ , then there is a finite Σ0 Ď Σ such that Σ0 |ù τ ,

where Σ is an infinite set of wffs and τ is a wff.

Problem 8 (5 points). Consider the following axiomatic presentation of classical sentential logic.

• Alphabet: A “ tA1 , A2 , . . . , An , . . . , , ÝÑ, q, pu

• Language: L “ tall wffsu

• Axioms: Ax “ tα ÝÑ pβ ÝÑ αq, pα ÝÑ pβ ÝÑ γqq ÝÑ ppα ÝÑ βq ÝÑ pα ÝÑ γqq, p β ÝÑ

αq ÝÑ pα ÝÑ βqu Ď L

α, α ÝÑ β
• Rule of inference: (Modus ponens)
β

(Note: This is the same axiomatic system that was discussed in class.)

Find a syntactic derivation for α ÝÑ γ from the set Γ “ tα ÝÑ pβ ÝÑ γq, βu, i.e., show that
Γ $ α ÝÑ γ.
(Hint: Use the deduction theorem.)

Indraprastha Institute of Information Technology - Delhi Page 2