Scribd
Upload
11 views5 pages

Homework1 Baypazzar

The document outlines the instructions for Homework 1 in CSCI 2011, focusing on logic. It specifies the use of AI assistants with restrictions, the requirement for individual completion, and the necessity of justifying answers. The assignment includes various logical problems related to propositions, quantifiers, and rules of inference.

Uploaded by

ham.burger615767
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
11 views5 pages

Homework1 Baypazzar

The document outlines the instructions for Homework 1 in CSCI 2011, focusing on logic. It specifies the use of AI assistants with restrictions, the requirement for individual completion, and the necessity of justifying answers. The assignment includes various logical problems related to propositions, quantifiers, and rules of inference.

Uploaded by

ham.burger615767
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

CSCI 2011 Homework 1

Topic: Logic

Instructions:
• Questions listed as “Section x.y Problem z” are from the course textbook.
• This assignment must be completed individually, on your own.
• You may use an AI assistant such as Chat-GPT or Claude on this assignment, but there
are important restrictions:
o You must use an AI assistant account that saves your chat history for future
reference. Be prepared to log in to your AI assistant account and show your "live"
chat history to the instructor or TAs.
o You must cite AI whenever it was used. It is sufficient to cite the name of the AI
model and the type of help you received. For example: (received hints from
ChatGPT) or (copied answer from Chat-GPT).
o You are not allowed to rely on an AI model that allows you to directly browse and
copy online solutions to similar problems.
o You must have your own conversation with the AI assistant; you are not allowed
to share your conversation output with other students. o Be aware that the AI
models do get things wrong!
o Please do not rely on these to do the work for you because this will inhibit your
own learning, and because they make mistakes. Practice using AI as a tutor.
• When answering questions, always justify your answer.
• Unless otherwise stated, you cannot use truth tables to prove logical equivalences.
• Full credit requires exemplary answers that are clear, concise, and complete.

Alignment to the textbook:

• Question 1 is related to sections 1.1 and 1.2


• Questions 2 and 3 are related to section 1.3
• Questions 4 and 5 are related to section 1.4
• Question 6 is related to section 1.5 • Question 7 is related to section 1.6 Questions:

1. Consider the following propositions p, q, and r.

p: "The restaurant is closed."


q: "I am hungry." r:
"I will eat lunch."

(a) (5 points) Write the following English sentence as a proposition using p, q, and/or r:
"I will eat lunch if the restaurant is open."
(b) (5 points) Write the following English sentence as a proposition using p, q, and/or r:
"I will eat lunch only if I am hungry and the restaurant is open."

(c) (5 points) Write the following proposition as an English sentence: ¬ r → ¬ q

If im not hungry im not gonna eat lunch.

2. (10 points) Section 1.3 Problem 12b on page 38.

3. (10 points) Show that (p Ù ¬q) Ú (¬p Ù q) and ¬ (p Ù q) Ù (p Ú q) are logically


equivalent using the laws of logic. State each equivalence on the left, and the law of
logic used on the right.
(Hint: begin by applying the distributive law to (p Ù ¬q) Ú (¬p Ù q).
If it is confusing, you can treat it like (p Ù ¬q) Ú r, and then replace r with (¬p Ù q).
4. Let C(x) be the statement "x is in this class," and F(x) be "x is a friendly person." Express
each of these statements in terms of C(x), F(x), quantifiers, and logical connectives. (a)
(10 points) "Someone is in this class".

(b) (10 points) "Only friendly people are in this class".

5. Section 1.4 Problems 40b, d on page 59 (be extremely clear).


a. (5 points) Section 1.4 #40b
b. (5 points) Section 1.4 #40d

6. Let the binary predicate F(x,y) be the statement "You can fool person x at time y".

a. (10 points) Express the famous Bob Marley quote, "You can fool some people
sometimes, but you can't fool all the people all the time" using F(x,y) and
quantifiers. You must simplify all negations (no negations to the left of a
quantifier). You may use a compound predicate statement involving Ù or
Ú.

b. (5 points) Negate the previous statement, simplify all negations, and express as a
statement in English, as simply as you can.
7. (20 points) Prove the conclusion from the premises, stating the rules of inference that you
use. You must number the lines of your proof and reference the appropriate lines
when you state the rules of inference.

"If there is a tree in the park, it is over 10 years old. Every tree over 10 years old has deep
roots. There is a tree in the park. Therefore, there is a tree with deep roots in the park."
Let P(x) be, "x is in the park," let T(x) be, "x is over 10 years old," and let R(x) be, "x has
deep roots." Use y to represent an unspecified oak tree.

Here are the premises: ∀x(P(x) → T(x)), ∀x(T(x) → R(x)), ∃x P(x)

Here is the desired conclusion: ∃x(P(x) Ù R(x))

You might also like