Name: Course: Exercise Sheet: Propositional Logic: P Q P P Q P Q P Q P Q P (P Q) R B W
Name: Course: Exercise Sheet: Propositional Logic: P Q P P Q P Q P Q P Q P (P Q) R B W
(a) ¬p
(b) p ∨ q
(c) p ∧ q
(d) p ⇒ q
(e) ¬p ⇒ ¬q
(f) ¬p ∨ (p ∧ q)
2. Formalise the following in terms of atomic propositions r, b, and w, first making clear
how they correspond to the English text.
(a) Berries are ripe along the path, but rabbits have not been seen in the area.
(b) Rabbits have not been seen in the area, and walking on the path is safe, but
berries are ripe along the path.
(c) If berries are ripe along the path, then walking is safe if and only if rabbits have
not been seen in the area.
(d) It is not safe to walk along the path, but rabbits have not been seen in the area
and the berries along the path are ripe.
(e) For walking on the path to be safe, it is necessary but not sufficient that berries
not be ripe along the path and for rabbits not to have been seen in the area.
(f) Walking is not safe on the path whenever rabbits have been seen in the area and
berries are ripe along the path.
3. Form alise the se st atements and determine (with truth tables or otherwise) w hether
they are consistent (i.e. if there are some assum ptions on the atomic propositions that
make it true ): “The system is in a multiuser state if and only if it is operating normally.
If the system is oper ating norm ally, the kerne l is functioning. Either the kerne l is not
functioning or the system is in interrupt m ode. If the system is not in m ultiuser state ,
then it is in interrupt mode. The system is not in interrupt mode.”
4. When is a propositional formula P valid ? When is P satisfiable?
5. For e ach of the following propositions, construct a truth table and state whether the
proposition is valid or satisfiable . (For brevity, you c an just write one truth t able w ith
many columns.)
(a) p ∧ ¬p
(b) p ∨ ¬p
(c) (p ∨ ¬q) ⇒ q
(d) (p ∨ q) ⇒ (p ∧ q)
(e) (p ⇒ q) ⇔ (¬q ⇒ ¬p)
(f) (p ⇒ q) ⇒ (q ⇒ p)
6. For each of the following propositions, construct a truth table and state whether the
proposition is valid or satisfiable.
(a) p ⇒ (¬q ∨ r)
(b) ¬p ⇒ (q ⇒ r)
(c) (p ⇒ q) ∨ (¬p ⇒ r)
(d) (p ⇒ q) ∧ (¬p ⇒ r)
(e) (p ⇔ q) ∨ (¬q ⇔ r)
(f) (¬p ⇔ ¬q) ⇔ (q ⇔ r)
7. Formalise the following and, by writing truth tables for the premises and conclusion,
determine whether the arguments are valid.
Either John isn’t stupid and he is lazy, or he’s stupid.
(a) John is stupid.
Therefore, John isn’t lazy.
The butler and the cook are not both innocent
(b) Either the butler is lying or the cook is innocent
Therefore, the butler is either lying or guilty
8. Use truth tables to determine which of the following are equivalent to each other:
(a) P
(b) ¬P
(c) P ⇒ F
(d) P ⇒ T
(e) F ⇒ P
(f) T ⇒ P
(g) ¬¬P
9. Use truth tables to determine which of the following are equivalent to each other: