COS3761/101/3/2019

Tutorial Letter 101/3/2019

Formal Logic
COS3761

Semesters 1 and 2

Computer Science Department

This tutorial letter contains important information

about your module.

BARCODE
 CONTENTS

Page

1 INTRODUCTION .......................................................................................................................... 3
2 PURPOSE AND OUTCOMES ...................................................................................................... 3
2.1 Purpose ........................................................................................................................................ 3
2.2 Outcomes ..................................................................................................................................... 3
3 LECTURER(S) AND CONTACT DETAILS................................................................................... 3
3.1 Lecturer(s) .................................................................................................................................... 3
3.2 Department ................................................................................................................................... 3
3.3 University ...................................................................................................................................... 4
4 RESOURCES ............................................................................................................................... 4
4.1 Prescribed book(s) ........................................................................................................................ 4
4.2 Recommended book(s) ................................................................................................................. 4
4.3 Electronic reserves (e-reserves) ................................................................................................... 4
4.4 Library services and resources ..................................................................................................... 4
5 STUDENT SUPPORT SERVICES ................................................................................................ 5
6 STUDY PLAN ............................................................................................................................... 5
7 PRACTICAL WORK ..................................................................................................................... 5
8 ASSESSMENT ............................................................................................................................. 5
8.1 Assessment criteria....................................................................................................................... 5
8.2 Assessment plan .......................................................................................................................... 7
8.3 Assignment numbers .................................................................................................................... 8
8.3.1 General assignment numbers ....................................................................................................... 8
8.3.2 Unique assignment numbers ........................................................................................................ 8
8.4 Assignment due dates .................................................................................................................. 8
8.5 Submission of assignments .......................................................................................................... 8
8.6 The assignments ........................................................................................................................ 10
8.7 Other assessment methods ........................................................................................................ 74
8.8 The examination ......................................................................................................................... 74
9 FREQUENTLY ASKED QUESTIONS ........................................................................................ 74
10 SOURCES CONSULTED ........................................................................................................... 74
11 IN CLOSING ............................................................................................................................... 74
12 ADDENDUM ............................................................................................................................... 74

2
 COS3761/101/3/2019

Dear Student

1 INTRODUCTION
Dear Student
Welcome to Formal Logic 3 (COS3761). We hope that you will find the module interesting and
stimulating. You are most welcome to contact your lecturers for any academic queries
regarding the module – see sections 3.1 and 3.2 below. (See section 3.3 for information
regarding other kinds of queries.)
This tutorial letter contains general information about COS3761: we discuss the tutorial matter,
student support, the syllabus, the requirements for examination admission, the semester mark
and how to submit assignments. In addition, this tut letter contains Assignments 1, 2 and 3,
first for the first semester and then for the second semester as well.
Some quick facts about the three assignments:

 You must submit at least one assignment to get examination admission.

 The three assignments contribute towards your semester mark, which counts
20% of your final mark.

2 PURPOSE AND OUTCOMES

2.1 Purpose
The purpose of studying logic is to refine one’s natural ability to reason and argue. Logic is
concerned with training the mind to think clearly. The aim of logic is to obtain clarity in the
definition and arrangement of our ideas and other mental images, consistency in our
judgements, and validity in our processes of inference. Logic is about representing knowledge
in a precise language so that a computer can reason about it, i.e. so that an algorithm can be
defined to make valid deductions from the knowledge. Logic is applied extensively in the
fields of Artificial Intelligence, Computer Science and Philosophy, and this module aims to
provide a solid foundation for these studies
2.2 Outcomes
At the end of this module you should have obtained strategies for thinking effectively, know
about the common errors in reasoning which should be avoided and have developed effective
techniques for evaluating arguments. You should know some of the logic languages used to
represent knowledge, and understand some of the computer algorithms used to reason about
the knowledge represented in such languages Abbreviated syllabus:
o propositional logic – declarative sentences, natural deduction, semantics, normal forms
o predicate logic – syntax, natural deduction, semantics, undecidability
o modal logics – syntax, semantics, logic engineering, natural deduction, multi-agent systems

3 LECTURER(S) AND CONTACT DETAILS

3.1 Lecturer(s)
The names and contact details of the lecturers for COS3761 are specified in Tutorial Letter
COSALLF/301/4/2016. Students may contact lecturers by mail, e-mail or telephone. We
recommend the use of e-mail.

3
Students may make appointments to see a lecturer, but this has to be done well in advance.
Students should mention their student numbers in all communications with the lecturers
3.2 Department
If you have not yet received the contact details of your lecturer and would like to speak to him
or her, you may contact the secretary of the School of Computing. Remember to mention your
student number.
This is for academic queries only. Please do not contact the School about missing tutorial
matter, cancellation of a module, payments, enquiries about the registration of assignments,
and so on, but rather the relevant department as indicated in the brochure my Studies @
Unisa
3.3 University
The brochure my Studies @ Unisa (that you should have received with your tutorial
matter) contains information about computer laboratories, the library, myUnisa,
assistance with study skills and so on. It also contains contact details of several Unisa
departments, for example Examinations, Assignments, Despatch, Finances and
Student Administration. Remember to mention your student number when contacting
the University

4 RESOURCES
4.1 Prescribed book(s)
Huth, M & Ryan, M. 2005. Logic in computer science: modelling and reasoning about systems.
2nd edition. United Kingdom: Cambridge University Press.
4.2 Recommended book(s)
NO
4.3 Electronic reserves (e-reserves)
E-reserves can be downloaded from the Library catalogue. More information is available at:
http://libguides.unisa.ac.za/request/request
4.4 Library services and resources
The Unisa Library offers a range of information services and resources:

 for detailed Library information go to

http://www.unisa.ac.za/sites/corporate/default/Library
 for research support and services (e.g. personal librarians and literature
search services) go to
http://www.unisa.ac.za/sites/corporate/default/Library/Library-
services/Research-support

The Library has created numerous Library guides:

http://libguides.unisa.ac.za
Recommended guides:

 Request and download recommended material:

4
 COS3761/101/3/2019

http://libguides.unisa.ac.za/request/request
 Postgraduate information services:
http://libguides.unisa.ac.za/request/postgrad
 Finding and using library resources and tools:
http://libguides.unisa.ac.za/Research_skills
 Frequently asked questions about the Library:
http://libguides.unisa.ac.za/ask
 Services to students living with disabilities:
http://libguides.unisa.ac.za/disability

Type here

5 STUDENT SUPPORT SERVICES

The Study @ Unisa brochure is available on myUnisa: www.unisa.ac.za/brochures/studies
This brochure has all the tips and information you need to succeed at distance learning and,
specifically, at Unisa.

6 STUDY PLAN
Use the brochure my Studies @ Unisa for general time management and
planning skills.
The due dates for assignments are given in section 7.3 below. The learning
units for COS3761 on myUnisa give directions for working though the
relevant sections of the prescribed book and the other resources, and what
to do in preparation for the assignments and the exam.

7 PRACTICAL WORK
NO

8 ASSESSMENT
8.1 Assessment criteria

A range of tasks (tutorial letters, assignments and examinations) will show that students have
achieved the following outcomes, namely to:

Range:
The context of this module is a subfield of the domain of Logic using tools of propositional,
predicate and basic modal logic, with an increased complexity of a number of sentences (or
“worlds”), with greater complexity, with mathematical reasoning, with assumptions chosen for
unknown contexts to define a mode of truth (a belief, knowledge, necessity, future). Arguments
start from one or more assumptions (premises) and leading to some conclusion.

5
Specific outcome 1:

Construct and interpret propositional and predicate logic sentences.

Assessment criteria:
1. Logical connectives are used to combine given names and predicates correctly to translate
given English sentences into sentences of propositional or predicate logic;
2. Logical connectives and symbols are interpreted correctly to translate given propositional or
predicate logic sentences into English sentences;
3. The parse tree of a given predicate logic formula is constructed and all its subformulas are
listed correctly;
4. Correct substitution of variables of a predicate logic formula is done.

Specific outcome 2:

Construct models and sentences to demonstrate understanding of the semantics of

propositional logic, predicate logic and basic modal logic.

Assessment criteria:
1. A model where a given propositional logic, predicate logic or basic modal logic sentence is
true or false is constructed;
2. A propositional, predicate or basic modal logic sentence that is true or false in a given
model is constructed;
3. A propositional, predicate or basic modal logic model where an entailment relation does not
hold is constructed;
4. A propositional, predicate or basic modal logic model showing that a given sequent is not
provable is constructed.

Specific outcome 3:
Give formal proofs of “sequents” in propositional logic, predicate logic or basic modal
logic.

Assessment criteria:
1. A proof by mathematical induction of some theorem is given;
2. The rules of Natural Deduction are used to construct formal proofs of sequents in
propositional logic or predicate logic where every line of the proofs consists of a First-order
Logic sentence following on the previous line(s) while citing the applicable rule;
3. Formal proofs of sequents in modal logic K or modal logic KT45 are constructed
using the rules of Natural Deduction.

Specific outcome 4:
Demonstrate understanding of concepts like “satisfiability”, validity, soundness and
completeness in propositional logic, predicate logic and basic modal logic.

6
 COS3761/101/3/2019

Assessment criteria:
1. A sentence that is true in a given model but that is not valid is given;
2. An algorithm is used to show that a given formula is satisfiable or not;
3. The correspondence between a provable sequent and semantic entailment is
explained.

Specific outcome 5:
Interpret and apply various modes of truth, within a context where a modal logic is
constructed that is capable of expressing and formalizing a given mode of truth involving
one or more agent.

Assessment criteria:
1. Given English sentences involving one or more agent and dealing with a specific mode of
truth, are translated correctly into basic modal logic sentences using logical connectives to
combine given propositional symbols;
2. Given basic modal logic sentences involving one or more agent and dealing with
a specific mode of truth are translated into English sentences interpreting the
logical connectives and symbols correctly
8.2 Assessment plan
The marks that you obtain for Assignments 1 and 2 form the semester mark for COS3761. The
semester mark forms 20% and the examination 80% of the final mark for the module.
The weights of the COS3761 assignments are indicated in the table below.

Assignment Weight

1 30%

2 40%

3 30%

An example follows:

Assignment Marks obtained Weight Contribution to semester mark

1 30% 30% 30/100 x 30/100 x 20 1.8

2 45% 40% 45/100 x 40/100 x 20 3.6

3 20 30% 20/100 x30/100 x20 1.2

Total 6.6

In this example the student has a semester mark of 6.6. The semester mark will not form part
of the final mark of a supplementary examination.

7
8.3 Assignment numbers
8.3.1 General assignment numbers

Semester 1 Assignment 1

Assignment 2

Assignment 3

Semester 2 Assignment 1

Assignment 2

Assignment 3

8.3.2 Unique assignment numbers

Semester 1 Assignment 1 745877

Assignment 2 839876

Assignment 3 848420

Semester 2 Assignment 1 740847

Assignment 2 838540

Assignment 3 838299

8.4 Assignment due dates

Assignment number Due date of COS3761 assignment Weight for

semester
Semester 1 Semester 2 mark

1 25 February 2019 20 August 2019 30%

(multiple choice)
Compulsory for admission
to the examination

2 25 March 2019 20 September 40%

2019

3 (multiple choice question) 18 April 2019 11 October 2019 30%

8.5 Submission of assignments

To do assignments is extremely important for mastering the study material. We strongly advise
you to do all three assignments.
The three assignments of both the first and second semesters are given in Section 8.6 of this
tutorial letter.. Give yourself enough time to do the assignments properly. You should realize
that an hour or two will not be sufficient. Follow the procedures in this tutorial letter, in Tutorial

8
 COS3761/101/3/2019

Letter COSALLF/301/4/2019 and in the brochure my Studies @ Unisa when submitting your
assignments.

 Assignment 1 is a multiple choice assignment and has to be submitted

either on a mark reading sheet (by post) or electronically through myUnisa.
There is no extension of the due date for this assignment.

 Assignment 2 may be submitted (i) electronically as a .pdf file (by using

myUnisa) or (ii) through normal post inside an assignment cover with all the
particulars filled in on the cover. The semester system does not allow for late
submission of the assignment.

 Assignment 3 is a multi choice assignment . During the last weeks of the

semester you have to study modal logic. It is an interesting and very important
part of your module and about 40% of the examination questions deals with it

9
 8.6 The Assignments

 THE ASSIGNMENTS OF THE FIRST SEMESTER

ASSIGNMENT 01 FIRST SEMESTER

(MULTIPLE CHOICE)

SUBMISSION: On multiple choice form or electronically through myUnisa

Please note that Assignment 01 has to be submitted in order to gain examination

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

If you want to submit the assignment electronically and 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 25 February 2019

Extension No extension

Tutorial matter Textbook chapter 1

30%

Weight of contribution to semester 20 questions, 5 options each. Choose one option in

mark every question

Unique number 745877

Questions 20

We recommend

• that you write out a formal proof for (at least) questions 7 to 11 before choosing an
option and

• if you have access to a computer, that you use the Fitch software (supplied with the
textbook of the second-level Formal Logic module COS2661) to help you to choose the
correct option in questions dealing with formal proofs.

10
 COS3761/101/3/2019

Propositional logic symbol Declarative sentence associated with the symbol

p It is windy

q It is cloudy

r There is a dust storm

s There is a hail storm

t The temperature is above 35°C

Table 1

QUESTION 1

Using the symbols and their intended meaning given in Table 1, which of the options below is
a correct propositional logic translation of the following English sentence?

If the temperature is above 35°C, it will neither be cloudy nor will there be a hail storm.

Option 1: t   (q  s)

Option 2: t   (q  s)

Option 3: t   q   s

Option 4: t  ( q   s)

Option 5: None of the above options is a correct translation.

QUESTION 2

Using the symbols and their intended meaning given in Table 1, which of the options below is
a correct propositional logic translation of the following English sentence?

There will be a hail storm only if it is cloudy and not windy and the temperature is 35°C or
less.

Option 1: s  (q   p  t)

Option 2: s  (q   p   t)

Option 3: (q   p   t)  s

Option 4: (q   p   t)  s

Option 5: None of the above options is a correct translation.

11
QUESTION 3

Using the symbols and their intended meaning given in Table 1, which of the options below is
a correct propositional logic translation of the following English sentence?

There is a hail storm or a dust storm but not both.

Option 1: (r  s)   r  s

Option 2: (r  s)  ( r  s)

Option 3: (r  s)   (r  s)

Option 4: (r  s)   (r  s)

Option 5: None of the above options is a correct translation.

QUESTION 4

Using the symbols and their intended meaning given in Table 1, which of the options below is
a correct English translation of the following propositional logic sentence?

(q  t   p)   (r  s)

Option 1: It is cloudy but not windy and the temperature is above 35°C if and only if there is
neither a dust nor a hail storm.

Option 2: It is cloudy but not windy and the temperature is above 35°C only if there
is neither a dust nor a hail storm.

Option 3: If it is cloudy but not windy and the temperature is above 35°C, there is
neither a dust nor a hail storm.

Option 4: It is cloudy but not windy and the temperature is above 35°C if and only if there is
either a dust or a hail storm.

Option 5: None of the above options is a correct translation.

QUESTION 5

Using the symbols and their intended meaning given in Table 1, which of the options below is
a correct English translation of the following propositional logic sentence?

 (r  s  t)

Option 1: There is either no dust or no hail storm or the temperature is not above 35°C.

Option 2: There is no dust and no hail storm or the temperature is not above 35°C.

Option 3: There is neither a dust nor a hail storm and the temperature is not above 35°C.

12
 COS3761/101/3/2019

Option 4: There is neither a dust nor a hail storm or the temperature is not above 35°C.

Option 5: None of the above options is a correct translation.

QUESTION 6

Using the symbols and their intended meaning given in Table 1, which of the options below is
a correct English translation of the following propositional logic sentence?

t  p q

Option 1: It is windy and cloudy if the temperature is above 35°C.

Option 2: Only if the temperature is not above 35°C, it is windy and cloudy.

Option 3: It is windy and cloudy if and only if the temperature is not above 35°C.

Option 4: Unless the temperature is above 35°C, it is windy and cloudy.

Option 5: None of the above options is a correct translation.

QUESTION 7

Suppose you have to formally prove the validity of the following sequent using the basic
natural deduction rules:

q  r ├ (p  q)  (p  r)

Write out a proof on some rough paper and then choose the option below that gives a correct
strategy.

Option 1:

 Start with the premise q  r.

 Have a subproof starting with the assumption of p.

 Have another (nested) subproof, also starting with the assumption of p.

 Inside the subsubproof, first derive q (using the  e rule) and then r (using the  e rule
again).

 Exit the subsubproof and derive p  r, using the  i rule.

 Exit the subproof and derive (p  q)  (p  r), using the  i rule.

Option 2:

 Start with the premise q  r.

13
 Have a subproof starting with the assumption of p.

 Assume p  q.

 First derive q (using the  e rule) and then r (using the  e rule again).

 Derive p  r, using the  i rule.

 Exit the subproof and derive (p  q)  (p  r), using the  i rule.

Option 3:

 Start with the premise q  r.

 Have a subproof starting with the assumption of p  q.

 Have another (nested) subproof, starting with the assumption of p.

 Inside the subsubproof, first derive q (using the  e rule) and then r (using the  e rule
again).

 Exit the subsubproof and derive p  r, using the  i rule.

 Exit the subproof and derive (p  q)  (p  r), using the  i rule.

Option 4:

 Start with the premise q  r.

 Have a subproof starting with the assumption of p  q.

 Assume p.

 Now derive q (using the  e rule) and then r (using the  e rule again).

 Derive p  r, using the  i rule.

 Exit the subproof and derive (p  q)  (p  r), using the  i rule.

Option 5: None of the above options describes a correct strategy.

QUESTION 8

Suppose you have to formally prove the validity of the following sequent using the basic
natural deduction rules:

p  q ├ ((p  q)  p)  (p  (p q))

Which of the options below is a correct proof?

14
 COS3761/101/3/2019

Option 1:

1 pq premise

2 pq assumption

3 p  e1 2

4 (p  q)  p i 2–3

5 p assumption

6 q  e 1, 5

7 pq  i 5, 6

8 p  (p  q) i 5–7

9 ((p  q)  p)  (p  (p q))  i 4, 8

Option 2:

1 pq premise

2 pq assumption

3 p  e1 2

4 (p  q)  p i 2–3

5 p assumption

6 q  e 1, 5

7 pq  i 5, 6

8 p  (p  q) i 5–7

9 ((p  q)  p)  (p  (p q))  i 4, 8

15
Option 3:

1 pq premise

2 pq assumption

3 p  e1 2

4 (p  q)  p i 2–3

5 q  e 1, 3

6 pq  i 3, 5

7 p  (p  q) i 3–6

8 ((p  q)  p)  (p  (p q)) i 4, 7

Option 4:

1 pq premise

2 q assumption

3 p  e 1, 2

4 pq  i 2, 3

5 p copy 3

6 (p  q)  p i 4–5

7 p  (p  q) i 3–4

8 ((p  q)  p)  (p  (p q))  i 6, 7

Option 5: None of the options above is a correct proof.

QUESTION 9

We have to prove the validity of the following sequent using the rules of natural deduction:

(p  q)  (p  r) ├ p  q  r

The following proof is given but two lines are omitted. Which of the options below gives the
correct propositional logic sentence and the associated correct rule in both lines?

16
 COS3761/101/3/2019

1 (p  q)  (p  r) premise

2 p assumption

3 pq  e1 1

4 q  e 2, 3

6 r  e 2, 5

8 p  qr i 2-7

Option 1:

5 pr  e2 1

7 qr  i 4, 6

Option 2:

5 pr i 2

7 qr  i 4, 6

Option 3:

5 pr  e2 1, 3

7 qr i 4-6

Option 4:

5 pr  e2 1

7 qr i 4-6

Option 5: None of the options above gives the correct propositional logic sentence and
associated rule for both lines.

QUESTION 10

We have to prove the following sequent using the basic natural deduction rules:

(p  (q  p))  q ├ p

In the proof below the rules that are used in three of the lines are omitted. Which option below
gives the correct rule in each line?
17
 1 (p  (q  p))  q premise

2 p  (q  p)

3 q  e2 1

4 p assumption

5 p copy 4

6 qp assumption

7 p

8 p

Option 1:

2 i 1

7  e 3, 6

8  e 1, 4 - 5, 6 – 7

Option 2:

2  e1 1

7  e 1, 4 - 5, 6

8 copy 5, 7

Option 3:

2 assumption

7 copy 4

8 copy 5, 7

Option 4:

2  e1 1

7  e 3, 6

8  e 2, 4 - 5, 6 - 7

Option 5: None of the options above gives correct rules for all three lines.

18
 COS3761/101/3/2019

QUESTION 11

We have to prove the following sequent using the basic natural deduction rules:

pq, ¬pr, ¬q¬r ├ q

In the proof below the sentences in three of the lines are omitted. Which option below gives
the correct sentence in each line?

1 pq premise

2 ¬pr premise

3 ¬q¬r premise

4 ¬q assumption

5 ¬r  e 3, 4

6 assumption

7 r  e 2, 6

8  ¬ e 5, 7

9 ¬i 6-8

10 p ¬¬e 9

11 q  e 1, 10

12 ¬ e 4, 11

13 ¬¬q ¬ i 4 - 12

14 q ¬ ¬ e 13

Option 1:

6 ¬¬p

9 

12 

Option 2:

6 ¬p

9 ¬¬p

12 

19
Option 3:

6 ¬p

9 

12 

Option 4:

6 ¬p

9 ¬¬p

12 ¬ q  q

Option 5: None of the options above gives the correct sentence in every line.

QUESTION 12

Given the following propositional logic sentence, which of the options below is the
corresponding parse tree?

(p  q  r)  (¬ r  (q  r))

Option 1:




p
 ¬ 

q r r q r

20
 COS3761/101/3/2019

Option 2:





p  
¬r

q q r
r

Option 3:






r ¬ 

q
p
r q r

Option 4:


 

 ¬r 
r

q r
p q

Option 5: None of the options above gives the correct parse tree for the given sentence.

21
QUESTION 13

Given the following parse tree, which option below gives the associated propositional logic
sentence?
¬

 

¬ q
 r

p r
q

Option 1: ¬ (¬ (q  (p  r))  (r  q))

Option 2: ¬ (¬ q  (p  r))  (r  q)

Option 3: ¬ ((¬ (q  (p  r))  (r  q)))

Option 4: ¬ ((¬ q  p)  r)  (r  q)

Option 5: None of the options above gives the correct associated sentence.

Question 14
Which of the following sequents are valid:

Option 1: (p  q  r, q ├ r

Option2: p  q, ¬ p ├ ¬ q

Option 3: (p  q  r, ¬ q ├ p
Option 4 : q, p ↔ q ├ p
Option 5 : Option 2 and option 4 are valid sequents.

QUESTION 15
Consider the following sequent and then choose the correct option below.

p  (q  r) ├ (p  q)  (p  r)

Option 1: The sequent is valid and can be formally proved using natural deduction rules.
22
 COS3761/101/3/2019

Option 2: The sequent is not valid as shown by the following valuation: p = T, q = F, r = T

Option 3: The sequent is not valid as shown by the following valuation: p = F, q = F, r = F

Option 4: The sequent is valid as shown by the following valuation: p = F, q = F, r = T

Option 5: None of the options above is correct

QUESTION 16

Consider the following sequent and then choose the correct option below.

p  (q  r) ├ (p  q)  (p  r)

Option 1: The sequent is valid and can be formally proved using natural deduction rules.

Option 2: The sequent is valid as shown by the following valuation: p = F, q = F, r = T

Option 3: The sequent is not valid as shown by the following valuation: p = F, q = F, r = F

Option 4: The sequent is not valid as shown by the following valuation: p = T, q = F, r = T

Option 5: None of the options above is correct.

QUESTION 17

Draw the truth tables of the following three propositional logic sentences and then choose the
correct option below.

q  ( p  r)

(q   r)  p

p  (q  r)

Option 1: q  ( p  r) ├ (q   r)  p.

Option 2: The sentences q  ( p  r) and (q   r)  p are semantically equivalent.

Option 3: The sentence p  (q  r) is not semantically entailed by the sentences q

 ( p  r) and (q   r)  p because of their respective truth values for the valuations p = T,
q = F, r = F and p = F, q = T, r = F.

Option 4: The sentence p  (q  r) is semantically entailed by the sentences q 

( p  r) and (q   r)  p.

Option 5: None of the options above is correct.

23
QUESTION 18

Consider the following:

A, B ╞ C

where A, B and C are propositional logic sentences. Choose the correct option below.

Option 1: A, B ╞ C means that at least one of the sentences A, B or C is true for

every valuation.

Option 2: A, B ╞ C means that C is false if both A and B are false.

Option 3: A, B ╞ C means that C will be true if both A and B are true.

Option 4: A, B ╞ C means that C will be true if either A or B is true.

Option 5: None of the options above is correct.

QUESTION 19

Suppose the HORN algorithm is used to determine whether the following propositional logic
sentence is satisfiable or not:

 (p  q  s  p)  (q  r  p)  (p  s  s)  (T  r)

 After the first step has been executed, we have the following (underlining is used to
indicate marking):

 (p  q  s  p)  (q  r  p)  (p  s  s)  (T  r)

Which of the options below gives the situation after the next step has been completed?

Option 1: (p  q  s  p)  (q  r  p)  (p  s  s)  (T  r)

Option 2: (p  q  s  p)  (q  r  p)  (p  s  s)  (T  r)

Option 3: (p  q  s  p)  (q  r  p)  (p  s  s)  (T  r)

Option 4: (p  q  s  p)  (q  r  p)  (p  s  s)  (T  r)

Option 5: None of the options above is correct.

QUESTION 20

Dealing with propositional logic, which of the options below is correct?

Option 1: If we can show that A, B ╞ C, there exists a proof of A, B ├ C.

24
 COS3761/101/3/2019

Option 2: A sequent is valid if and only if the conclusion is true for all valuations.

Option 3: A formula is semantically entailed by other formulas if at least one valuation

makes all the formulas true.

Option 4: A formula is semantically entailed by other formulas if at least one valuation

makes all the formulas true and no valuation makes all the formulas false.

Option 5: More than one of the options above are correct.

25
 ASSIGNMENT 02 FIRST SEMESTER

SUBMISSION: Printouts or 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.

If you want to submit the assignment electronically and 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 25 March 2019

Extension No extension

Tutorial matter Textbook: All previous work and chapter 2

Hint: Read carefully through the Tutorial letter 102 chapters 1 and 2
sections on models in Tutorial letter
102. (See Tutorial letter 102 about material that
need not be studied.)

40%
Weight of contribution to semester
mark 839876

Unique number

26
 COS3761/101/3/2019

Predicate symbols

T(x) x is a teenager

S(x) x is a soccer player

R(x) x is a rugby player

C(x) x is a sport club

W(x) x wins

P(x, y) x plays for y

M(x, y) x plays against y (think of M as indicating a

match)

Constants

E Eric

G Gail

R Radebe

H Harlequins

I Injas

Function symbol

b(x) the brother of x

Table 2

QUESTION 1 [18]

Use the predicate, function and constant symbols and their intended meanings given in Table
2 to translate the English sentences given below into predicate logic:

Question 1.1

Injas do not win any match except when Eric plays for them or when they play against
Harlequins.

Question 1.2

Every teenager is a soccer or a rugby player but no teenager plays both soccer and rugby.

27
Question 1.3

When Harlequins play against any club they win only if at least one player’s brother also plays
for Harlequins.

Question 1.4

There is a teenager that is a soccer player but does not play for any club.

Question 1.5

Radebe's brother and Gail play for Injas but Radebe plays for a different club.

Question 1.6

There is a rugby player that plays for Injas only if Eric does not play for Injas.

QUESTION 2 [10]

Use the predicate, function and constant symbols and their intended meanings given in Table
2 and translate the following sentences of predicate logic into English:

Question 2.1

x (C(x)  y (T(y)  P(y, x)))

Question 2.2

¬ x (C(x)  y (C(y)  P(x, y)  W(x)))

Question 2.3

x (R(x)  P(x, h))  x (C(x)  y (S(y)  P(y, x)))

Question 2.4

(R(e)  R(r))  (S(b(r))  S(b(g)))

Question 2.5

x ((C(x)  P(i, x))  W(i))  x (C(x)  P(h, x)  W(h))

QUESTION 3 [7]

Let

 P and Q be two predicate symbols, each with two arguments,

 f a function symbol with one argument and
 c a constant.

28
 COS3761/101/3/2019

For each of the following, state whether it is a term or a well-formed formula (wff) or neither. If
it is not a term or a wff, state the reason.

3.1 P(f(c), x)

3.2 f(P(c, x))

3.3 x Q(f(x), c)  x P(x, x)

3.4 y

3.5 x y (Q(x)  P(y, x))

3.6 P(x, Q(x, y))

3.7  f(x)

QUESTION 4 [10]

Let φ be the formula

(x P(x, y)  y P(x, y))  z Q(x, y, z)

where P is a predicate symbol with two arguments and Q is a predicate symbol with three
arguments.

Question 4.1 (4)

Draw the parse tree of the formula and indicate the free and bound variables.

Question 4.2 (6)

Suppose f is a function symbol with one argument. For each of the following substitutions,
state whether it will create a problem. If there is no problem, write down the substituted
formula. If there will be a problem, state how you would solve it and then write down the
substituted formula.

Question 4.2.1 φ[f(y) / x]

Question 4.2.2 φ[f(z) / y]

Question 4.2.3 φ[f(x) / z]

QUESTION 5 [4]

Show that the following set of formulas is consistent by constructing a model where both
formulas are true. Take A, the universe of concrete values, as the set of all integers n > 3.
(Note that the formula does not involve any function symbols.)

x (S(x)  y Q(x, y))

29
 x ¬ Q(x, x)

QUESTION 6 [6]

Given the sentence

x (¬ R(x, x)  y R(x, y))

where R is a predicate with two arguments, construct two models: one model where the
sentence is true and another model where the sentence is false.

QUESTION 7 [4]

Given the sentence

x (R(x, x)  y ¬ R(x, y)),

does the model M below satisfy it? Explain your answer.

A = {a, b, c, d}

RM = {(a, a), (a, b), (a, c), (b, a), (b, b), (b, c), (b, d)}

QUESTION 8 [6]

Show that the validity of the following sequents cannot be proved by finding for each of them a
model where all formulas to the left of ├ evaluate to T but the formula to the right of ├
evaluates to F. Give two models in each case: one should be a mathematical model and the
other should be a non-mathematical model.

Question 8.1

x y S(x, y) ├ y x S(x, y)

Question 8.2

x (R(x)  Q(x)) ├ x (R(x)  Q(x))

QUESTION 9 [35]

Using the rules of natural deduction, prove the validity of the following sequents in predicate
logic. In all cases, number your steps, indicate which rule you are using and indicate subproofs
clearly.

Question 9.1 (7)

x (P(x)  Q(x)) ├ (x ¬ Q(x))  (x ¬ P(x))

30
 COS3761/101/3/2019

Question 9.2 (5)

x (P(x)  Q(x)) ├ x P(x)  x Q(x)

Question 9.3 (8)

x y (S(x, y)  S(y, x)) ├ x y S(x, y)

Question 9.4 (7)

¬ x ¬ P(x) ├ x P(x)

Question 9.5 (8)

x (P(x)  Q(x)) ├ ¬ (¬ x P(x)  ¬ x Q(x))

31
 ASSIGNMENT 03 FIRST SEMESTER

Due date 18 April 2019

Extension Not applicable

Tutorial matter Textbook: chapter 5

Weight of contribution to 30%

semester mark

No unique number
848420

x2

q
x1
x3
p
p, q

x4

Figure 1: Kripke model used in Questions 1, 2, 3, 4 and 5

32
 COS3761/101/3/2019

QUESTION 1
In which world of the Kripke model in Figure 2 is the formula □ ◊ ¬ q true?

Option 1: x1

Option 2: x2

Option 3: x3

Option 4: x4

Option 5: The formula is not true in any world of the Kripke model.

QUESTION 2
Which of the following holds in the Kripke model in Figure 2?

Option 1: x1 ╟ □ p

Option 2: x2 ╟ □ (p  q)

Option 3: x3 ╟ ◊ p  □ q

Option 4: x3 ╟ □ □ ¬ q

Option 5: x4 ╟ □ p  □ ¬ q

QUESTION 3
Which of the following does not hold in the Kripke model given in Figure 2?

Option 1: x1 ╟ □ □ q

Option 2: x2 ╟ □ p  q

Option 3: x2 ╟ ◊ p  □ ¬ q

Option 4: x3 ╟ □ (p  ¬ q)

Option 5: x4 ╟ p  q

33
QUESTION 4
Which of the following formulas is true in the Kripke model given in Figure 2?
Option 1: ◊□q

Option 2: □ (p  q)

Option 3: □◊q

Option 4: □p◊¬q

Option 5: qp

QUESTION 5

Which of the following formulas is false in the Kripke model given in Figure 2?
Option 1: ◊◊¬p

Option 2: ◊ (p  q)

Option 3: □ ◊ (p  q)

Option 4: p◊p

Option 5: □p◊¬p

QUESTION 6

If we interpret □  as "It ought to be that  ", which of the following formulas correctly
expresses the English sentence
I ought to be happy and I'm allowed to be unhappy.
where p stands for the declarative sentence "I am happy"?

Option 1: □p◊p

Option 2: ¬◊¬p◊p

Option 3: □p◊¬p

Option 4: □p¬□p

Option 5: It is impossible to translate this sentence into a formula of modal logic with the
required interpretation.

34
 COS3761/101/3/2019

QUESTION 7

If we interpret □  as "It is necessarily true that  ", why should the formula scheme □   □ ¬ 
not hold in this modality?

Option 1: Because it is not the case that for all formulas , it is necessarily true that  is
either true or false.

Option 2: Because for all formulas ,  is necessarily true or necessarily false.

Option 3: Because for some formulas ,  is neither necessarily true nor necessarily false.

Option 4: Because for no formula , is  either necessarily true or not possibly true.

Option 5: □   □ ¬  should hold in this modality.

QUESTION 8

If we interpret □  as "After any execution of program P,  holds", why should the formula
scheme □   ◊  not hold in this modality?

Option 1: Because it is not the case that if  holds after every execution P, then  does not
hold after some execution of P.

Option 2: Because for a program P that never executes correctly, there is no execution of
P after which  holds.

Option 3: Because even if there is some execution of P after which  does not hold, it
doesn't mean that  does not hold after any execution of P.

Option 4: Because there may be a program P such that even though  holds after every
execution P,  does not hold after some execution.

Option 5: □   ◊  should hold in this modality, because if  holds after every execution
of P, it should hold after at least one execution of P.

QUESTION 9

If we interpret □  as "Always in the future (where the future does not include the present) it will
be true that  ", which of the following formulas should not be valid?

Option 1: □pp

Option 2: □p□□q

Option 3: ◊¬p◊p
35
Option 4: ◊p¬◊◊¬p

Option 5: ◊¬p□□p

QUESTION 10

If we interpret □  as "Agent A believes  ", what is the English translation of the formula □ p 
◊ ¬ q?

Option 1: Agent A believes p and Agent B believes not q.

Option 2: Agent A believes p and he believes that Agent B does not believe q.

Option 3: Agent A believes p, but q is not consistent with his beliefs.

Option 4: Agent A believes p and he believes that Agent B believes not q.

Option 5: Agent A believes p but he doesn't believe q.

QUESTION 11

If we interpret □  as "Agent A believes  ", what formula will be correctly translated to English
as
If agent A believes p then he doesn't believe q.

Option 1: □p□¬q

Option 2: □ (p  ¬ q)

Option 3: □p◊q

Option 4: □p◊¬q

Option 5: ◊ (¬ p  ¬ q)

36
 COS3761/101/3/2019

QUESTION 12
Consider the following Kripke frame:

x1 x2 x3

Which of the following modal logics does this frame conform to?

Option 1: KT

Option 2: KB

Option 3: KD

Option 4: K4

Option 5: KT45

The following natural deduction proof (without reasons) is referred to in Questions 13, 14 and
15:

1 ¬□

2 □p

3 □¬p

4 p
5 ¬p
6 
7 □
8 

9 ¬□¬p

10 □p¬□¬p

QUESTION 13
How many times are □ elimination and introduction rules used in the above proof?

37
Option 1: None

Option 2: □ elimination and □ introduction once are both used only once.

Option 3: □ elimination is used only once but □ introduction twice.

Option 4: □ elimination is used twice but □ introduction only once.

Option 5: □ elimination and □ introduction are both used twice.

QUESTION 14

What is the correct reason for steps 1, 2 and 3 of the above proof?

Option 1: 1 premise
2 assumption
3 assumption

Option 2: 1 premise
2 ¬e 1
3 ¬i 2

Option 3: 1 assumption
2 ¬e 1
3 □e 4

Option 4: 1 assumption
2 □i 2
3 assumption

Option 5: 1 premise
2 □i 1
3 ¬i 2

QUESTION 15
What sequent is proved by the above proof?

38
 COS3761/101/3/2019

Option 1: ◊ □p◊p

Option 2: □p◊p

Option 3: ¬□ ¬ □   (□ p  ◊ p)

Option 4: ¬ □   (□ p  ¬ □ ¬ p)

Option 5: It's impossible to say without the reasons.

The following incomplete natural deduction proof is referred to in Questions 16 and 17:

1 □p assumption
2 p axiom T 1

3
4
5  ¬e 2,4

6 ¬□¬p ¬i 3-5

7 □p¬□¬p i 1-6

QUESTION 16
What formulas and their reasons are missing in steps 3 and 4 of the above proof?
Option 1: 3 □p copy 1
4 ¬□p ¬i 3

Option 2: 3 □¬p assumption

4 ¬p axiom T 3

Option 3: 3 □□p axiom T 1

4 ¬p □□e 3

Option 4: 3 □p □i 2
4 ¬□p ¬i 3

Option 5: None of the above.

39
QUESTION 17

In what modal logics is the above proof (with the correct formulas for steps 3 and 4) valid?
Option 1: K

Option 2: KD

Option 3: K4

Option 4: K5

Option 5: KT45

QUESTION 18
What proof strategy would you use to prove the following sequent:

□ (p  q) KT4 □□p□□q

Option 1: Open a solid box and start with □ (p  q) as an assumption.

Use axiom T to remove the □ to get p  q.

Use  elimination twice to obtain the separate atomic formulas.

Use axiom 4 twice, i.e. once on each atomic formula, to add a □ to each.
Use axiom 4 twice, i.e. once on □ p and once on □ q, to get □ □ p and □ □ q.

Combine □ □ p and □ □ q using  introduction. Close the solid box to get

the result.

Option 2: Start with □ (p  q) as a premise.Use axiom T to remove the □ to get p  q.

Open a dashed box and use  elimination twice to obtain the separate atomic
formulas
.Use axiom 4 twice, i.e. once on each atomic formula, to add a □ to each.
Close the dashed box and use □ introduction twice, i.e. once on □ p and once
on □ q, to get □ □ p and □ □ q.

Combine □ □ p and □ □ q using  introduction.

40
 COS3761/101/3/2019

Option 3: Start with □ (p  q) as a premise.

Open a dashed box and use □ elimination to get p  q.
Use  elimination twice to obtain the separate atomic formulas.
Close the dashed box and use □ introduction twice, i.e. once on each atomic formula.
Use axiom 4 twice, once on □ p and once on □ q, to get □ □ p and □ □ q.
Combine □ □ p and □ □ q using  introduction.

Option 4: Open a solid box and start with □ (p  q) as an assumption.

Open a dashed box and use □ elimination to get p  q.
Use  elimination twice to obtain the separate atomic formulas.
Use axiom 4 twice, i.e. once on each atomic formula, to add a □ to each.
Close the dashed box and use □ introduction twice, i.e. once on □ p and once on □ q, to
get □ □ p and □ □ q.
Close the solid box to get the result.

Option 5: This is not a valid sequent in KT4.

QUESTION 19

If we interpret Ki  as "Agent i knows  ", what is the English translation of the formula K 1 ¬ K2
p  q?

Option 1: Agent 1 knows that agent 2 doesn't know that p implies q.

Option 2: Agent 1 doesn't know that agent 2 knows that p implies q.

Option 3: If agent 1 knows that agent 2 doesn't know p, then q.

Option 4: If agent 1 doesn't know that agent 2 knows p, then q.

Option 5: Agent 1 knows that if agent 2 doesn't know p, then q.

QUESTION 20

If we interpret Ki  as "Agent i knows  ", what formula of modal logic is correctly translated to
English as
If agent 1 knows p then agent 2 doesn't know q.

41
Option 1: K1 p  K2 ¬ q

Option 2: ¬ (K1 p  K2 q)

Option 3: K1 (p  ¬ K2 q)

Option 4: K1 ¬ K2 (p  q)

Option 5: K1 ¬ p  ¬ K 2 q

42
 COS3761/101/3/2019

THE ASSIGNMENTS OF THE SECOND SEMESTER

ASSIGNMENT 01 SECOND SEMESTER

(MULTIPLE CHOICE)

SUBMISSION: On multiple choice form or electronically through myUnisa

Please note that Assignment 01 has to be submitted in order to gain

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

If you want to submit the assignment electronically and 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 20 August 2019

Extension No extension

Tutorial matter Textbook chapter 1

Weight of contribution to semester 30%

mark

Unique number
740847
Questions
20 questions, 5 options each. Choose one
option in every question.

We recommend

• that you write out a formal proof for (at least) questions 7 to 11 before choosing an option
and

• if you have access to a computer, that you use the Fitch software (supplied with the
textbook of the second-level Formal Logic module COS2661) to help you to choose the correct
option in questions dealing with formal proofs.

43
 Propositional logic Declarative sentence associated with the
symbol symbol

p It is windy

q It is cloudy

r There is a dust storm

s There is a hail storm

t The temperature is above 35°C

Table 3

QUESTION 1

Using the symbols and their intended meaning given in Table 3, which of the options below is
a correct propositional logic translation of the following English sentence?

There is a dust storm only if it is windy but not cloudy.

Option 1: p  q  r

Option 2: (p   q)  r

Option 3: r  (p   q)

Option 4: r  (p   q)

Option 5: None of the above options is a correct translation.

QUESTION 2

Using the symbols and their intended meaning given in Table 3, which of the options below is
a correct propositional logic translation of the following English sentence?

If there is hail storm, there is neither a dust storm nor is the temperature above 35°C.

Option 1: s  ( r   t)

Option 2: s   (r  t)

Option 3: s   (r  t)

Option 4: s  r  t

Option 5: None of the above options is a correct translation.

44
 COS3761/101/3/2019

QUESTION 3

Using the symbols and their intended meaning given in Table 3, which of the options below is
a correct propositional logic translation of the following English sentence?

It is windy or not cloudy or the temperature is above 35°C unless there is a hail storm.

Option 1:  s  (p   q  t)

Option 2: s  (p   q  t)

Option 3:  s  (p   q  t)

Option 4: s  p  q  t

Option 5: None of the above options is a correct translation.

QUESTION 4

Using the symbols and their intended meaning given in Table 3, which of the options below is
a correct English translation of the following propositional logic sentence?

 (r  s)

Option 1: There is not a hail storm and there is not a dust storm.

Option 2: There is neither a hail storm nor a dust storm.

Option 3: There is either a hail storm or a dust storm.

Option 4: A hail storm and a dust storm do not occur at the same time.

Option 5: None of the above options is a correct translation.

QUESTION 5

Using the symbols and their intended meaning given in Table 3, which of the options below is
a correct English translation of the following propositional logic sentence?

s  (q   t)

Option 1: If it is cloudy and the temperature is not above 35°C, there is a hail storm.

Option 2: If it is cloudy or the temperature is not above 35°C, there is a hail storm.

Option 3: There is a hail storm only if it is cloudy and the temperature is not above 35°C.

Option 4: There is a hail storm only if it is cloudy or the temperature is not above 35°C.

Option 5: None of the above options is a correct translation.

45
QUESTION 6

Using the symbols and their intended meaning given in Table 3, which of the options below is
a correct English translation of the following propositional logic sentence?

( p   q)  (p  q)

Option 1: It is either windy and not cloudy or it is cloudy and not windy.

Option 2: It is windy and cloudy.

Option 3: It is neither windy nor cloudy.

Option 4: It is windy or cloudy.

Option 5: None of the above options is a correct translation.

QUESTION 7

Suppose you have to formally prove the validity of the following sequent using the basic
natural deduction rules:

p  (q  r), p  q ├ p  r

Write out a proof on some rough paper and then choose the option below that gives a correct
strategy.

Option 1:

 Start with the two premises p  (q  r) and p  q.

 Use the  elimination rule to derive p.

 Use the  elimination rule three times, deriving q  r, q and r one after the other.

 Use the  introduction rule to derive p  r.

Option 2:

 Start with the two premises p  (q  r) and p  q.

 Assume p.

 Use the  elimination rule three times, deriving q  r, q and r one after the other.

 Use the  introduction rule to derive p  r.

Option 3:

46
 COS3761/101/3/2019

 Start with the two premises p  (q  r) and p  q.

 Have a subproof starting with the assumption of p.

 Use the  elimination rule three times, deriving q  r, q and r one after the other.

 Exit the subproof and derive p  r by using the  introduction rule.

Option 4:

 Start with the two premises p  (q  r) and p  q.

 Have a subproof starting with the assumption of p.

 Use the  elimination rule three times, deriving q  r, q and r one after the other.

 Derive p  r by using the  introduction rule and then exit the subproof..

Option 5: None of the above options describes a correct strategy.

QUESTION 8

Suppose you have to formally prove the validity of the following sequent using the basic
natural deduction rules:

p  q ├ r  ((p  s)  (q  s))  r

Which of the options below is a correct proof?

Option 1:

1 p  q premise
2 r assumption

3 s assumption

4 sr  i 2, 3

5 (p  q)  (s  r)  i 1, 4

6 ((p  s)  (q  s))  r distributive 5

7 r  ((p  s)  (q  s))  r i 2-6

47
Option 2:

1 p  q premise

2 r assumption

3 s assumption

4 (p  q)  s  i 1, 3

5 (p  s)  (q  s) distributive 4

6 ((p  s)  (q  s))  r  i 2, 5

7 r  ((p  s)  (q  s))  r i 2-6

Option 3:

1 p  q premise

2 r assumption

3 p assumption

4 (p  s)  (q  s)  i1 3

5 ((p  s)  (q  s))  r  i 2, 4

6 q assumption

7 (p  s)  (q  s)  i2 6

8 ((p  s)  (q  s))  r  i 2, 7

9 ((p  s)  (q  s))  r  e 1, 3 – 5, 6 - 8

10 r  ((p  s)  (q  s))  r i 2-9

48
 COS3761/101/3/2019

Option 4:

1 p  q premise

2 r assumption

3 p assumption

4 ps  i1 3

5 (p  s)  (q  s)  i1 4

6 ((p  s)  (q  s))  r  i 2, 5

7 q assumption

8 qs  i1 7

9 (p  s)  (q  s)  i2 8

10 ((p  s)  (q  s))  r  i 2, 9

11 ((p  s)  (q  s))  r  e 1, 3 – 6, 7 - 10

12 r  ((p  s)  (q  s))  r  i 2 - 11

Option 5: None of the options above is a correct proof.

QUESTION 9

We have to prove the validity of the following sequent using the rules of natural deduction:

r, p  (r  q) ├ p  (q  r)

The following proof is given but two lines are omitted. Which of the options below gives the
correct propositional logic sentence and the associated correct rule in both lines?

1 r premise

2 p  (r  q) premise

4 rq  e 2, 3

5 q  e 1, 4

6 q r  i 1, 5

7
49
Option 1:

3 q r assumption

7 p  (q  r) i 3-6

Option 2:

3 p assumption

7 p  (q  r) i 3-6

Option 3:

3 ¬ (p  (q  r)) assumption

7  ¬e 3–6

Option 4:

3 p assumption

7 ¬ ¬ (p  (q  r)) ¬¬i 3–6

Option 5: None of the options above gives the correct propositional logic sentence and
associated rule for both lines.

QUESTION 10

We have to prove the following sequent using the basic natural deduction rules:

├ ¬ p  (p  (p  q))

In the proof below the rules that are used in three of the lines are omitted. Which option below
gives the correct rule in each line?

1 ¬p assumption

2 p

3 

4 p q

5 p  (p  q) i 2-4

6 ¬ p  (p  (p  q)) i 1-5

Option 1:

2 premise

3 ¬e 1

50
 COS3761/101/3/2019

4 e 3

Option 2:

2 assumption

3 ¬ e 1, 2

4 e 3

Option 3:

2 assumption

3 ¬e 1

4 i 2-3

Option 4:

2 assumption

3 ¬ e 1, 2

4 e 2-3

Option 5: None of the options above gives correct rules for all three lines.

QUESTION 11

We have to prove the following sequent using the basic natural deduction rules:

p  (q  r), ¬ q, ¬ r ├ ¬ p

In the proof below the sentences in three of the lines are omitted. Which option below gives
the correct sentence in each line?

51
 1 p  (q  r) premise

2 ¬q premise

3 ¬r premise

4 assumption

5 qr  e 1, 4

6 q assumption

7 ¬ e 2, 6

8 r assumption

9  ¬ e 3, 8

10  e 5, 6 – 7, 8 - 9

11 ¬p ¬ i 4 - 10

Option 1:

4 p

7 

10 

Option 2:

4 p

7 ¬p

10 

Option 3:

4 ¬p

7 

10 ¬p

Option 4:

4 ¬p

7 

52
 COS3761/101/3/2019

10 

Option 5: None of the options above gives the correct sentence in every line.

QUESTION 12

Given the following propositional logic sentence, which of the options below is the
corresponding parse tree?

(¬ p  q)  (¬ r  (q  (p  r)))

Option 1:





 ¬ q 

¬ q r p r

53
Option 2:


¬ 

p q 

¬ 

r q 

p r

Option 3:






¬ q 

p ¬ q p r

54
 COS3761/101/3/2019

Option 4:






q ¬
¬

p q 
r

rp r

Option 5: None of the options above gives the correct parse tree for the given sentence.

QUESTION 13

Given the following parse tree, which option below gives the associated propositional logic
sentence?




  r
¬

s r ¬ r 

q p s

55
Option 1: (s  r)  ((¬ q  r)  (¬ (p  s)  r))

Option 2: (s  r)  (¬ q  r)  ((¬ p  s)  r)

Option 3: (s  r)  (¬ (q  r))  (¬ (p  s)  r)

Option 4: (s  r)  (¬ q  r)  ¬ (p  (s  r))

Option 5: None of the options above gives the correct associated sentence.

QUESTION 14

Given the following parse tree, which option below gives the associated propositional logic
sentence?

¬
¬

 

¬ q
 r

p r
q

Option 1: ¬ (¬ (q  (p  r))  (r  q))

Option 2: ¬ (¬ q  (p  r))  (r  q)
Option 3: ¬ ((¬ (q  (p  r))  (r  q)))
Option 4: ¬ ((¬ q  (p  r))  (r  q))
Option 5: None of the options above gives the correct associated sentence.

56
 COS3761/101/3/2019

QUESTION 15

Consider the following sequent and then choose the correct option below.
(p  q)  s,  s ├ p  ¬ q
Option 1: The sequent is valid because the relation (p  q)  s,  s ├ p  ¬ q
holds as shown by the following valuation:p=T, q=T, s = False

Option 2: The sequent is valid because the relation (p  q)  s,  s ╞ p  ¬ q

holds as shown by the following valuation: p = F, q = F, s = F.

Option 3: The sequent is not valid because the relation (p  q)  s,  s ╞ p  ¬ q

holds as shown by the following valuation: p = F, q = T, s = F.

Option 4: The sequent is not valid because the relation (p  q)  s,  s ╞ p  ¬ q

holds as shown by the following valuation: p = F, q = T, s = T

Option 5: option 1 and option 2 are correct.

QUESTION 16

Consider the following sequent and then choose the correct option below.

p  q, s  t ├ (p  s)  (q  t)

Option 1: The sequent is valid and can be formally proved using natural deduction rules.

Option 2: The sequent is valid as shown by the following valuation:

p = F, q = F, s = F, t = T

Option 3: The sequent is not valid as shown by the following valuation:

p = F, q = T, s = T, t = F

Option 4: The sequent is not valid as shown by the following valuation:

p = F, q = F, s = T, t = T

Option 5: None of the options above is correct.

QUESTION 17

Draw the truth tables of the following three propositional logic sentences and then choose the
correct option below.

p  r

 (r  q)

57
(p  r)  q

Option 1: p  r,  (r  q) ├ (p  r)  q

Option 2: The sentence (p  r)  q is not semantically entailed by the sentences p  r

and (r  q) because the respective columns in the truth table are not identical.
Option 3: The sentence (p  r)  q is not semantically entailed by the sentences p  r
and (r  q) because of their respective truth values for the valuation p = T, q
= F, r = T.
Option 4: The sentence (p  r)  q is semantically entailed by the sentences p  r and
(r  q) because of their respective truth values for the valuation p = F, q = F, r
= T.

Option 5: None of the options above is correct.

QUESTION 18

Consider the following:

A, B ╞ C

where A, B and C are propositional logic sentences. Choose the correct option below.

Option 1: A, B ╞ C means that A, B and C are always true.

Option 2: A, B ╞ C means that C will be false if either A or B is false.

Option 3: A, B ╞ C means that C will be true if either A or B is true.

Option 4: A, B ╞ C means that C will only be true if both A and B are true.

Option 5: None of the options above is correct.

QUESTION 19

Suppose the HORN algorithm is used to determine whether the following propositional logic
sentence is satisfiable or not:

 (p  q  s  )  (q  r  p)  (T  s)  (s  q)

After the first step has been executed, we have the following (underlining is used to indicate
marking):

 (p  q  s  )  (q  r  p)  (T  s)  (s  q)

 Which of the options below gives the situation after the next step has been completed?

58
 COS3761/101/3/2019

Option 1: (p  q  s  )  (q  r  p)  (T  s)  (s  q)

Option 2: (p  q  s  )  (q  r  p)  (T  s)  (s  q)

Option 3: (p  q  s  )  (q  r  p)  (T  s)  (s  q)

Option 4: (p  q  s  )  (q  r  p)  (T  s)  (s  q)

Option 5: None of the options above is correct.

QUESTION 20

Dealing with propositional logic, which of the options below is correct?

Option 1: A model is a specific kind of valuation.

Option 2: A sequent can be proved to be valid if there is at least one valuation that makes
the premises and the conclusion true.
Option 3: A formula is semantically entailed by other formulas if there is at least one
valuation that makes all the formulas true.

Option 4: If we can show that A, B ╞ C, we will be able to prove A, B ├ C.

Option 5: More than one of the options above are correct.

59
 ASSIGNMENT 02 SECOND SEMESTER

SUBMISSION: Printouts or 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.

If you want to submit the assignment electronically and 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 20 September 2019

Extension No extension

Weight of contribution to semester 40%

mark

Unique number
838540

60
 COS3761/101/3/2019

Predicate symbols

T(x) x is a teenager

S(x) x is a soccer player

R(x) x is a rugby player

C(x) x is a sport club

W(x) x wins

P(x, y) x plays for y

M(x, y) x plays against y (think of M as indicating a

match)

Constants

e Eric

g Gail

r Radebe

h Harlequins

i Injas

Function symbol

b(x) the brother of x

Table 4

QUESTION 1 [18]

Use the predicate, function and constant symbols and their intended meanings given in Table
4 to translate the English sentences given below into predicate logic:

Question 1.1

If Gail’s brother plays for some club, all rugby players play for Harlequins.

Question 1.2

A club will only win against Injas if Radebe and his brother play for that club.

Question 1.3

There is a soccer player who will play for Harlequins if and only if no teenager plays for them.
61
Question 1.4

All clubs win sometimes.

Question 1.5

If two brothers play for Injas, Injas will win at least one match.

Question 1.6

There is a club that has no teenagers playing for them.

QUESTION 2 [10]

Use the predicate, function and constant symbols and their intended meanings given in Table
4 and translate the following sentences of predicate logic into English:

Question 2.1

x (C(x)  y (C(y)  M(x, y)  ¬ W(x)))

Question 2.2

¬ x (S(x)  P(x, h))  x (T(x)  P(x, i))

Question 2.3

x ((R(x)  P(x, i))  P(b(x), i))

Question 2.4

x (C(x)  y (R(y)  P(y, x))  y (S(y)  P(y, x)))

Question 2.5

x ((C(x)  P(g, x)  P(b(r), x)  M(x, i))  W(x))

QUESTION 3 [7]

Let

 P and Q be two predicate symbols, each with two arguments,

 f a function symbol with one argument and
 c a constant.

For each of the following, state whether it is a term or a well-formed formula (wff) or neither. If
it is not a term or a wff, state the reason.

3.1 Q(x, y)  c Q(x, c)

62
 COS3761/101/3/2019

3.2 f(f(f(c)))

3.3 (x  y)  c

3.4 x y (Q(x)  P(f(x), y))

3.5 Q(c, x)  P(x, c)

3.6 P(f(x), Q(x, y))

3.7  y  Q(y, c)

QUESTION 4 [10]

Let φ be the formula

x (P(x, y)  y Q(x, y, z))  z P(y, z)

where P is a predicate symbol with two arguments and Q is a predicate symbol with three
arguments.

Question 4.1 (4)

Draw the parse tree of the formula and indicate the free and bound variables.

Question 4.2 (6)

Suppose f is a function symbol with one argument. For each of the following substitutions,
state whether it will create a problem. If there is no problem, write down the substituted
formula. If there will be a problem, state how you would solve it and then write down the
substituted formula.

Question 4.2.1 φ[f(y) / x]

Question 4.2.2 φ[f(y) / z]

Question 4.2.3 φ[f(x) / y]

QUESTION 5 [4]

Show that the following set of formulas is consistent by constructing a model where both
formulas are true. Take A, the universe of concrete values, as the set of all integers n > 0.
(Note that the formula does not involve any function symbols.)

x y (S(x)  Q(x, y))

x (S(x)  ¬ y Q(y, x))

63
QUESTION 6 [6]

Given the sentence

¬ x y R(x, y)  x R(x, x)

where R is a predicate with two arguments, construct two models: one model where the
sentence is true and another model where the sentence is false.

QUESTION 7 [4]

Given the sentence

x y (R(x, x)  R(x, y)  R(y, x)),

does the model M below satisfy it? Explain your answer.

A = {a, b, c}

RM = {(a, a), (b, b), (c, c), (a, b), (b, a), (b, c)}

QUESTION 8 [6]

Show that the validity of the following sequents cannot be proved by finding for each of them a
model where all formulas to the left of ├ evaluate to T but the formula to the right of ├
evaluates to F. Give two models in each case: one should be a mathematical model and the
other should be a non-mathematical model.

Question 8.1

x (R(x)  Q(x)) ├ x (R(x)  Q(x))

Question 8.2

x y (S(x, y)  ¬ S(y, x)) ├ x S(x, x)

QUESTION 9 [35]

Using the rules of natural deduction, prove the validity of the following sequents in predicate
logic. In all cases, number your steps, indicate which rule you are using and indicate subproofs
clearly.

Question 9.1 (8)

x F(x)  x G(x) ├ x (F(x)  G(x))

64
 COS3761/101/3/2019

Question 9.2 (8)

x y (Q(y)  F(x)) ├ y Q(y)  x F(x)

Question 9.3 (8)

x (P(x)  Q(x)), x (P(x)  R(x)) ├ x (R(x)  Q(x))

Question 9.4 (4)

x ¬ P(x) ├ ¬ x P(x)

Question 9.5 (7)

x ((P(x)  Q(x))  (R(x)  S(x))), x ((T(x)  R(x))  Q(x)), x T(x)├ x (T(x)  R(x))

65
 ASSIGNMENT 03 SECOND SEMESTER

Due date 11 October 2019

Extension Not applicable

Weight of contribution to semester 30%

mark

unique number
838299

Questions
20

x3
x2 qqx
3

x1 p pp x4

Figure 2: Kripke world used in questions 1 and 2

66
 COS3761/101/3/2019

QUESTION 1

In which world of the Kripke model in Figure 1 is the formula ◊  p true?

Option 1: x1
Option 2: x2
Option 3: x4
Option 4: None of the options is true

QUESTION 2
Which of the following holds in the Kripke model given in Figure 1?
Option 1: x1 ╟ □ p
Option 2: x2 ╟ □ (p  q)
Option 3: x3 ╟ □ p  ◊ q
Option 4: None of the above

QUESTION 3
Which of the following does not hold in the Kripke model given in Figure 1?
Option 1: x1 ╟ ◊ q
Option 2: x1 ╟ □ (p  q)
Option 3: x2 ╟ □ ◊ p
Option 4: All of the above

QUESTION 4

Which of the following options is true in the Kripke model given in Figure 1?
Option 1: ◊p
Option 2: □q
Option 3: qp
Option 4: None of the above

QUESTION 5

Which of the following formulas is false in the Kripke model given in Figure 1?
Option 1: x1 ╟ p  q
Option 2: x2 ╟ □□p
Option 3: x3 ╟ □ (p  q)
Option 4: None of the above

67
QUESTION 6

If we interpret □  as "It ought to be that  ", which of the following formulas correctly
expresses the English sentence
It ought to be that if I am happy, I'm allowed to be unhappy.
where p stands for the declarative sentence "I am happy"?

Option 1: □p◊¬p
Option 2: ◊¬p¬□p
Option 3: □ (p  □ ¬ p)
Option 4: □ (p  ¬ ◊ p)
.

QUESTION 7

If we interpret □  as "It is necessarily true that  ", why should the formula scheme □   
hold in this modality?
Option 1: Because for all formulas , it is necessarily true that if  then .
Option 2: Because for all formulas , if  is necessarily true, then it is true.
Option 3: Because for all formulas , if  is not possibly true, then it is true.
Option 4: Because for all formulas ,  is necessarily true if it is true.

QUESTION 8

If we interpret □  as "After any execution of program P,  holds", why should the formula
scheme □    not hold in this modality?

Option 1: Just because  holds after every execution of P doesn't necessarily mean that 
holds before execution of P.
Option 2: Because it is not that case that after any execution of P, if  holds then  holds.
Option 3: Because if  does not hold before execution of P, it doesn't necessarily mean
that  holds after any execution of P.
Option 4: Because if  does not hold after every execution of P, it doesn't necessarily
mean that  holds before any execution of P.

QUESTION 9

If we interpret □  as "Always in the future (where the future does not include the present) it
will be true that  ", which of the following formulas should not be valid?

Option 1: □ p  □ □ p

68
 COS3761/101/3/2019

Option 2: ¬ □ p  ¬ ◊ ◊ ¬ p

Option 3 : ¬ ◊ ¬ p  □ p

Option 4: All of the above

QUESTION 10
If we interpret □  as "Agent A believes  ", what is the English translation of the formula □ p
 ¬ ◊ q?
Option 1: If Agent A believes p, then Agent B does not believe q.
Option 2: Agent A believes that if p, then q is not consistent with Agent A's beliefs.
Option 3: Agent A believes that if p, then Agent B does not believe q.
Option 4: If Agent A believes p, then Agent A believes not q.

QUESTION 11
If we interpret □  as "Agent A believes  ", what formula will be correctly translated to English
as
Agent A does not believe p or q.
Option 1: ◊ ¬ (p  q)
Option 2: □ ¬ (p  q)
Option 3: ¬□pq
Option 4: ◊¬pq

QUESTION 12

Consider the following Kripke frame

x1 x2 x3 x4

Which of the following modal logics does this frame conform to?
Option 1: KT
Option 2: KB
Option 3: KD
Option 4: K4

The following natural deduction proof (without reasons) is referred to in Questions 13, 14 and
15:

69
1 □ (p  q)

2 pq
3 p
4 q
5 □p
6 □q
7
8 □p□q

9 □ (p  q)  (□ p  □ q)

QUESTION 13

How many times are □ elimination and introduction rules used in the above proof?

Option 1: None
Option 2: □ elimination and □ introduction are both only used once.
Option 3: □ elimination is used only once but □ introduction twice.
Option 4: □ elimination is used twice but □ introduction only once.

QUESTION 14
What is the correct reason for steps 1, 2 and 3 of the above proof?
Option 1: 1 assumption
2 axiom T in line 1
3 e 2
Option 2: 1 premise
2 □i 1
3 □e 2
Option 3: 1 premise
2 assumption
3 i 2
Option 4: 1 assumption
2 □e 1
3 e 2

QUESTION 15

What sequent is proved by the above proof?

70
 COS3761/101/3/2019

Option 1: □ (p  q) □ (p  q)  (□ p  □ q)
Option 2: □ (p  q) □p□q
Option 3: □ (p  q)  (□ p  □ q)
Option 4: □p□q

The following incomplete natural deduction proof is referred to in Questions 16 and 17:

1 □¬□¬□p assumption
2

3 ¬□p assumption
4
5  ¬e 2,4
6 □p PBC 3-5
7

8 □¬□¬□p□□p i 1-7

QUESTION 16
Rules T, 4 and 5 are used in the missing lines of the above proof. Which rule is used in which
line?

Option 1: Rule T is used in line 2, rule 4 is used in line 4 and rule 5 is used in line 7.
Option 2: Rule 4 is used in line 2, rule 5 is used in line 4 and rule T is used in line 7.
Option 3: Rule T is used in line 2, rule 5 is used in line 4 and rule 4 is used in line 7.
Option 4: Rule 5 is used in line 2, rule T is used in line 4 and rule 4 is used in line 7.

QUESTION 17

What formulas belong in the missing lines of the above proof?

Option 1: ¬ □ ¬ □ p in line 2, □ ¬ □ p in line 4 and □ □ p in line 7

Option 2: □ □ ¬ □ ¬ □ p in line 2, □ ¬ □ ¬ □ p in line 4 and □ □ p in line 7
Option 3: ¬ □ ¬ □ p in line 2, ¬ □ ¬ □ p in line 4 and p in line 7
Option 4: □ □ ¬ □ ¬ □ p in line 2, ¬ □ ¬ □ p in line 4 and p in line 7

QUESTION 18

What proof strategy would you use to prove the following sequent:
├ KT4 □ □ (p  q)  (□ p  □ q)

Option 1:

71
• Open a solid box and start with □ □ (p  q) as an assumption.
• Use axiom T to remove one □.
• Open a dashed box and use □ elimination to get p  q.
• Use  elimination twice to obtain the separate atomic formulas.
• Close the dashed box and use □ introduction twice, i.e. once on each of the atomic
formulas.
• Combine □ p and □ q using  introduction.
• Close the solid box and use  introduction on the first and last formulas to get the result.
Option 2:
• Start with □ □ (p  q) as a premise.
• Use axiom T twice to remove both □ to get p  q.
• Use  elimination once to obtain the separate atomic formulas.
• Use axiom 4 twice, i.e. once on each atomic formula to add a □.
• Combine □ p and □ q using  introduction.
• Use  introduction on the first and last formulas to get the result.
Option 3:
• Start with □ □ (p  q) as a premise.
• Open a dashed box and use □ elimination to get □ (p  q).
• Open another dashed box and use □ elimination to get p  q.
• Use  elimination twice to obtain the separate atomic formulas.
• Close the first dashed box and use □ introduction on the first atomic formula.
• Close the second dashed box and use □ introduction on the second atomic formula.
• Combine □ p and □ q using  introduction.
• Use  introduction on the first and last formulas to get the result.
Option 4:
• Open a solid box and start with □ □ (p  q) as an assumption.
• Open a dashed box and use □ elimination to get □ (p  q).
• Use axiom T to remove one □ to get p  q.
• Use  elimination twice to obtain the separate atomic formulas.
• Use axiom 4 twice, i.e. once on each atomic formula to add a □.
• Close the dashed box and combine □ p and □ q using  introduction.
• Close the solid box and use  introduction on the first and last formulas to get the result.

QUESTION 19
If we interpret Ki  as "Agent i knows  ", what is the English translation of the formula K1 K2 ¬
p  q?
Option 1: Agent 1 knows that agent 2 doesn't know p implies q.
Option 2: Agent 1 knows that agent 2 knows that not p implies q.
Option 3: Agent 1 knows that if agent 2 doesn't know p, then q.
Option 4: If agent 1 knows that agent 2 knows not p, then q.
72
 COS3761/101/3/2019

QUESTION 20
If we interpret Ki  as "Agent i knows  ", what formula of modal logic is correctly translated to
English as
Agent 1 knows p but he doesn't know that agent 2 knows q.
Option 1: K1 (p  ¬ K2 q)
Option 2: K1 (p  K2 ¬ q)
Option 3: K1 p  ¬ K 1 K 2 q
Option 4: K1 p  K1 ¬ K 2 q

73
8.7 Other assessment methods
There are no assessment methods for this module.
8.8 The examination
Use the brochure my Studies @ Unisa for general examination guidelines and examination
preparation guidelines.
Make a note of your examination dates and arrange with your employer for leave in good time.
The COS3761 examination will be in May or June if you are registered for the first semester
and in October or November if you are registered for the second semester. Check for clashes
on the examination timetable and should there be any between your modules, discuss them
with the Student Administration department.
• To gain admission to the examination, you have to submit at least one assignment by its due
date.

9 FREQUENTLY ASKED QUESTIONS

The my Studies @ Unisa brochure contains an A-Z guide of the most relevant study
information

10 SOURCES CONSULTED
Prescribed book
• COS3761 Study guide

11 IN CLOSING
Submit all three assignments. In your studies this year you will acquire skills in reasoning and
evaluating arguments. If you study hard and purposefully, you are on your way to success.
We hope that you will enjoy your studies at Unisa. Everything of the best with your studies
this year.
12 ADDENDUM
None

UNISA 2019

74