Ferhat Abbas Sétif 1University 2024/2025
Faculty of Science
Computer Science Department Module : Mathematical Logic
Exercise series N°2
Exercice 1:
Consider the sentence: if x2 equals 4, then x equals 2.
Formulate this sentence in propositional language, then give its reciprocal, contrapositive and
negation (in natural and propositional language).
Exercice 2:
Give the negation of the following formula in its most simplified form:
(q ⇒ (p ˄ r)) ⇒(p ⇒ q)
Exercice 3 (from an exam):
Let α , β , γ be three propositional formulas such that :
α:x⟹x⟹x
β:¬x⟹¬x⟹¬x
γ:¬x˄y˄x
1. give the truth table for each formula (all three in the same table).
2. What can you say about these formulas? ( tautology/ contradiction/ satisfiable) ( justify)
3. Is { α , β } ⊨ γ?( ⊨ means the logical consequence )
4. Is the formula α ˄ β logically equivalent to the formula γ? (justify)
5. Is the formula α ˄ β ˄ γ a contradiction? (justify)
6. Is the set { α , β , γ } satisfiable?
7. Give the DNF and CNF of each of the formulas α , β, γ
8. Give the DNF and CNF of the formula α ˄ β ˄ γ
Exercice 4 (from an exam):
Let the propositional variables be:
p : “I'm late”, q : “I have an appointment” and r : “I hurry”.
1/ Represent the following statements in propositional logic:
a) If I'm not late, I don't hurry.
b) I only hurry if I'm late or if I have an appointment.
c) To hurry, it's necessary and sufficient to be late or to have an appointment.
d) Either I don't have an appointment, or I have to hurry.
2) Find two logical consequences x ⊨ y where x and y are among the propositions (a), (b) , (c), (d).
Exercice 5:
Express the following statements using the logical connector ↓ ( NOR) only.
1\ ¬ p 2\ p ˅ q 3\ p ˄ q 4\ p ⇒ q 5\ p ⇔ q 6\ Tautology
Exercice 6 :
1/ Give the truth table of the connector ( XOR)
2/ Write p q with ¬ , ˄ and ˅.
3/ Write ¬ ( p ˄ q) with ¬ , and ˅
Exercice 7 :
1/ Using the propositional algebra, show that the formula p ⇔ q is equivalent to the formula
( p ˅ q )⇒ ( p ˄ q)
2/ Are the following two formulas equivalent or not?
(p ⇒ (q ⇒ r)) ; (q ⇒ (p ⇒ r))
Exercice 8:
Find the disjunctive normal form (DNF) and conjunctive normal form (CNF) of formulas:
(using either truth table or proposition algebra):
1\ ¬ ( p ⇒ q) ˅ (¬ p ˄ r)
2\ p ⇔ ((q ˄ ¬ p) ˅ r)
3\ ¬ (¬ p ˅ q) ˄ ¬ r ˅ ¬ (¬ p ⇒ ¬ q)
4\ ¬ (p ⇒ q) ˅ ¬ ( ¬ p ˅ ¬ q) ˄ ¬ (¬ r ⇒ s)
Exercice 9:
Show by the absurd method that the following formulas are tautologies:
1/ ( (¬ A ⇒ B) ˄ (C ⇒ ¬ A)) ⇒ (¬ A ⇒ (¬ C ⇒ B))
2/ (¬ p ⇒ (¬ q ˅ r) ) ⇒ ( (¬ p ⇒ q) ⇒ (p ˅ r))
Exercice 10:
Show whether the following reasonings are valid or not (using truth tables).
1/ { A ⇒ ¬ B ˅ C, B ⇒ A ˄ ¬ C } ⇒ C ⇒ B
2/ { A ˄ ¬ B ˅ ¬ A ˄ B, C ⇒ B ˅ A } ⇒ B ˄ C
3/ { (¬ A ⇒ B) , (C ⇒ ¬ A) } ⇒ (¬ A ⇒ (¬ C ⇒ B))
Exercice 11 (from an exam):
Let be the following propositions:
p : “he needs a lawyer”.
q : “he has been arrested”.
r : “he had an accident”.
s : “he needs a doctor”.
t : “he is ill”.
Express the following formulas in natural language:
(a) : (t ⟹ s) ˄ (q ⟹ p)
(b) : p ⟹ (q ˅ r)
(c) : ¬ (q ˅ r) ⟹ ¬p
(d) : (s ˄ q) ⟹r
Exercice 12(from an exam):
Consider the following statements:
1. If Brahim fails his exam then he will be depressed.
2. If the weather is fine, Brahim will go the pool.
3. At the pool, Brahim doesn't work.
4. If Brahim doesn't go to the pool then he'll be depressed.
5. Brahim will fail his exam if he doesn't work.
A . Translate the above statements into propositional language
B. Show that “Brahim will be depressed” is a logical consequence of the five (05) previous
statements (using the method of your choice but not the truth table).
