1. Convert to CNF and clausal Form : (¬α → ¬β) → (α → β).

2. A formula in propositional logic is in DNF (Disjunctive Normal Form)

if it is a disjunction of conjunctions of literals. Now consider the w.f.f.
(α ∧ (α → ((β ∨ γ) ∧ ¬(β ∧ γ))) ∧ (α → ((δ ∨ θ) ∧ ¬(δ ∧ θ))) ∧ (δ →
β) ∧ ((¬γ) → θ) ∧ (θ → δ)).
(a) Write an equivalent CNF formula.
(b) Write a DNF formula equivalent to the above.
(c) List the clauses in the formula in clausal form.
(d) Using resolution, check the satisfiability of the given formula. Clearly
write down each step and each rule that you apply to get the steps.
3. Axiomatize equivalence relations in FOL.
4. Is ∃xφ ∧ ∃xψ equivalent to ∃x(φ ∧ ψ)
5. Consider the language of Number Theory with +, ×, 0, 1 respectively be-
ing the usual addition, multiplication and numbers zero and one.
(a) Write a formula LT (x, y) to express that x is less than y.
(b) Write a formula D(x, y) which says that x divides y
(c) Write formulas P r(x) and E(x) that says that x is a prime number
and x is an even number resp.
(d) Write a formula to represent the fact that z is the LCM of x and y
call it LCM (x, y, z).
(e) Goldbach conjecture states that every even integer greater than 2 is
the sum of two primes. Write a first order sentence which expresses
Goldbach conjecture.
6. In the deductive Hilbert system H of propositional logic, prove the theo-
rem: ` A → (B → (A ∧ B)). In case you need to use rules like exchange
of anticidents, contraposition, double negation etc, state and prove each
of them.