COS2661/104/0/2022

COS2661
ASSIGNMENT 02
100% Marks
SUBMISSION: Electronically through myUnisa (as one .pdf file)

It will be to your own advantage to check whether the assignment has been registered on the
system after a few days.

This assignment is submitted electronically and if myUnisa is off-line during that time, you need
not contact us, because we will be aware of it. Simply submit it as soon as myUnisa is available
again.

Due date 23 June 2023

Extension No extension

Tutorial matter Textbook Chapters:

Chapter 7: 7.1 – 7.4

Chapter 8: 8.1 - 8.4
Chapter 9: 9.1 – 9.6
Chapter 10: 10.1 – 10.4

Tutorial Letter 102 Chapters 7 to 10

Weight of contribution to semester mark 40%

Unique number 220989

QUESTION 1 [10]
Give the tautological equivalence of the following quantified sentences.
1.1 ¬x P(x) (2)
1.2 ¬∃x P(x) (2)
1.3 ∀x (P(x)  Q(x)) (2)
1.4 ∀x (P(x) → ¬Q(x)) (2)
1.5. ¬(∃x Cube(x)  ∀y Dodec(y)) ⇔ (2)
QUESTION 2 [14]
Study the table below and, translate the following English sentences into FOL.
Englis FOL
Names h
Richard richard
Vince vince
Felicity felicity
Red Arrows red
Blue Bucks blue

Predicates
x is a soccer player Player(x)
x is a teacher Teacher(x)
x is a team Team(x)
x plays for y Play(x, y)
x looses against y Loose(x, y)
x gets injured Injured(x)

2.1 If Richard plays for Red Arrows, he gets injured. (2)

2.2 Unless Felicity is a teacher, Vince and Richard will both play for Red Arrows. (2)
2.3 Everyone gets injured when Vince plays for Blue Bucks. (2)
2.4 No teachers are soccer players. (2)
2.5 If we assume that Vince plays for Blue Bucks, Felicity also plays for Blue Bucks but Richard plays
for Red Arrows. (2)
2.6 Richard plays for Blue Bucks if and only if Felicity and Vince are both teachers or neither of them is
a teacher. (2)
2.7 If Felicity and Vince get injured while they play for Blue Bucks, Richard will play for Red Arrows. (2)

QUESTION 3 [12]
Translate the following formal language of Tarski's World (FOL) sentences into English sentences.
3.1 ¬ Player(felicity) (2)
3.2 Play(vince, red) → Injured(richard) (2)
3.3 (Injured(vince)  Loose(red, blue)) ↔ (Play(richard, blue)  Play(felicity, blue)) (2)
3.4 ∃x (Team(x)  Loose(blue, x)) (2)
3.5 Play(vince, red) → ∃x (Player(x)  Injured(x)) (2)
3.6 x ((Team(x)  Play(felicity, x)) → Loose(x, red)) (2)

2
 COS2661/104/0/2022

QUESTION 4 [10]
The following arguments are all valid. Give the informal proofs of these arguments.
4.1 (5)
b is small unless it's a cube.
If c is small, then either d or e is too.
If d is small, then c is not.
If b is a cube, then e is not small.
If c is small, then so is b.

4.2 (5)
The unicorn, if horned, is elusive and dangerous.
If elusive or mythical, the unicorn is rare.
If a mammal, the unicorn is not rare.
The unicorn, if horned, is not a mammal.

QUESTION 5 [10]
Below are a number of expressions. State which are terms, some are atomic wffs (well-formed formulae)
and some are neither. If it is neither a term nor a wff, state the reason.
a) Large(y, Small(x, a, y))
b) brother_of(thabo)
c) $aQ(a, a)
d) Sad(x; y; 4:00)
e) ¬ y  B(y)
f) Tet(a)
g) Taller(aunty(z), z)

QUESTION 6 [6]
State which variables are free and bound in the given quantified sentences.
6.1 y∃x(P(y)  ∃z(P(x)  Q(z))) (3)
6.2 ∃x(Q(y)  z(Q(y) → z=x)) (3)
QUESTION 7 [38]
In this question, you have to construct formal proofs using the natural deduction rules. The Fitch system
makes use of these rules.

A summary of the rules of natural deduction is given on pages 573 to 578 of your textbook. Consult this
when you do question 6. Remember that De Morgan’s laws and other tautologies are not permissible
natural deduction rules. You are also not allowed to use Taut Con, Ana Con, or FO Con. It is important to
number your statements, indicate subproofs, and at each step give the rule that you are using.

Hint: If you have access to a computer, take advantage of the fact and use Fitch.

Question 7.1 (5)

In order to give a formal proof that some sentences are inconsistent, you have to take the following
sentences below as premises and (formally) derive a contradiction.
1. P  R
2. R →  P

Question 7.2 (8)

Using the natural deduction rules, give a formal proof of
P → S
from the premises
P → (Q  R)
Q → S
R → S

Question 7.3 (11)

Using the natural deduction rules, give a formal proof of (A → [B → C])  ([A  B] → C) from no premises.

Question 7.4 (14)

Using the natural deduction rules, give a formal proof of
¬Cube(a) → Small(b)
from the premises
Cube(a)  (Cube(b) → Tet(c))
Tet(c) → Small(c)
(Cube(b) →Small(c)) → Small(b)
End of Assignment 2:

© 2022
UNISA