ps2
ps2
Introduction to Logic
Problem Set 2
Hand in answers to the following questions at the start of class on Thursday, Sept. 21.
[Your proof outline should insert two sentences as steps in between the premises and conclusion, as
shown in the example below. Also write down the line numbers of the earlier statements used – a
maximum of two – next to each step.]
2. Show that the following argument is valid by providing a formal proof. (Fill in the
lines 4, 5 and 6, citing rules of inference, and fill in the rule for line 7.) [5 marks]
1
3. Translate each ‘circuit diagram’ below into a FOL sentence, and translate each FOL
sentence into a ‘circuit diagram’. [1 mark each, 6 total]
Also write down the type of each sentence, i.e. write “conjunction sentence’,
‘negation sentence’, or ‘disjunction sentence’ as appropriate. (It’s always the last
operator applied.) [1 mark each, 6 total]
(i)
(ii)
(iii)
(iv)
2
4. For each of the following sentences, write ‘T’ or ‘F’ next to it, according to whether
it is true or false in the world shown below. [Total 10 marks]
(Please do not use the program Tarski’s World to generate your answers – figure it out yourself,
perhaps using a circuit diagram. You may, however, use the program to check your answers.)
5. Draw a world in which all the sentences from Qu. 4 are true. (A couple of
modifications to the world shown above will do it.) [5 marks for world]
6. Show that the following arguments are invalid, by drawing a counterexample world
for each one. [3 marks each]
(i) (ii)