Hello, dear friend, you can consult us at any time if you have any questions, add WeChat: zz-x2580
COMP9020
Answer each of the following five (5) questions:
1. Translate the following into fully symbolic propositional logic - “Either
Alice is hungry or she is not”.
2. Translate the following into fully symbolic propositional logic - “If Bob is
tall then Alice is too”.
3. Translate the following into fully symbolic propositional logic - “Alice and
Bob will pass COMP9020 only if they both study hard”.
4. Is the following argument valid? If so, provide a natural deduction proof
via the rules in TABLE 2.3.1 on p.76 of the textbook. If not, then provide
a counterexample via either a truth-table or the short method of truth-
value assignments demonstrated in the lectures.
• 1. p ∧ ∼p
• ∴ q
5. What is the logical form for any statement that we can add to the set of
premises of a deductively valid argument in order to make the argument
invalid? Explain your answer in your own words.
This is the end of your questions. There are no more questions.
Your instructions are as follows:
Please submit your answers on Moodle under “Assignments - Problem Set 1”.
You may either typeset your answers or do them with a pen/pencil and paper
and upload a photograph. All normal file types are accepted.
Each question is worth one (1) mark. Each problem set is worth five (5) marks.
Each problem set is worth 5% of your final mark.
It is your responsibility to check and ensure that the file that you have uploaded
to Moodle (1) is the correct file, (2) is a readable file, and (3) has uploaded
correctly/is not corrupted. Re-uploads are available before the due date. Re-
uploads are not available after the due date. If a corrupted or incorrect file
remains on Moodle after the due date for a problem set, then you will receive
zero (0) marks for that problem set.
Please contact your tutor in the first instance with all and any questions that
you have concerning your problem set mark(s).
This is the end of your instructions. There are no more instructions.