Logic Test 1 - CS 381 - Prof. Shunichi Toida, Exams of Discrete Structures and Graph Theory

A logic test consisting of various logical propositions and arguments. The test includes filling in the blanks with valid propositions, expressing arguments in symbolic form using given propositions, negating statements, translating wffs into english, and finding the power set of sets. The test covers topics such as propositional logic, predicate logic, and set theory.

Typology: Exams

Pre 2010

Uploaded on 02/12/2009

koofers-user-j1m
koofers-user-j1m 🇺🇸

8 documents

1 / 3

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
CS 381 Test 1
October 16, 2004
1. Fill in the blanks with the shortest string of characters so that the
resultant proposition is valid. [15]
[[PQ][QR]] [PR]
¬[[PQ][QR]] ¬PR
¬[PQ] ¬[QR] ¬PR
¬[¬PQ] ¬[¬QR] ¬PR
[P ¬Q][Q ¬R] ¬PR
[P ¬Q] ¬P[Q ¬R]R
[[P ¬P][¬Q¬P]][[QR][¬RR]]
[ T [¬Q ¬P]] [[QR]T ]
T
2 (a) Express the argument given below using the symbols suggested for each
proposition. [5]
(b) Find where the glasses are using inference rules on the propositions in
symbolic form. [12]
Argument:
If my glasses are on the kitchen table(T), then I saw them at breakfast(B).
I was reading the newspaper in the living room (L)or in the kitchen(K). If
I was reading the newspaper in the living room, then my glasses are on the
coffee table(C). I did not see my glasses at breakfast. If I was reading the
newspaper in the kitchen, then my glasses are on the kitchen table.
(a)
TB
LK
LC
¬B
KT
(b)
TB
¬B
—————-
¬T
KT
pf3

Partial preview of the text

Download Logic Test 1 - CS 381 - Prof. Shunichi Toida and more Exams Discrete Structures and Graph Theory in PDF only on Docsity!

CS 381 Test 1

October 16, 2004

  1. Fill in the blanks with the shortest string of characters so that the resultant proposition is valid. [15]

[[P → Q] ∧ [Q → R]] → [P → R]

⇔ ¬[[P → Q] ∧ [Q → R]] ∨ ¬P ∨ R

⇔ ¬[P → Q] ∨ ¬[Q → R] ∨ ¬P ∨ R

⇔ ¬[¬P ∨ Q] ∨ ¬[ ¬Q ∨ R] ∨ ¬P ∨ R

⇔ [P ∧ ¬Q ] ∨ [Q ∧ ¬R] ∨ ¬P ∨ R

⇔ [P ∧ ¬Q] ∨ ¬P ∨ [Q ∧ ¬R] ∨ R

⇔ [[P ∨ ¬P ]∧[¬Q∨¬P ]]∨[[Q∨R]∧[¬R ∨ R]]

⇔ [ T ∧ [¬Q ∨ ¬P ]] ∨ [[Q ∨ R] ∧ T ]

⇔ T

2 (a) Express the argument given below using the symbols suggested for each proposition. [5] (b) Find where the glasses are using inference rules on the propositions in symbolic form. [12]

Argument: If my glasses are on the kitchen table(T), then I saw them at breakfast(B). I was reading the newspaper in the living room (L)or in the kitchen(K). If I was reading the newspaper in the living room, then my glasses are on the coffee table(C). I did not see my glasses at breakfast. If I was reading the newspaper in the kitchen, then my glasses are on the kitchen table.

(a) T → B L ∨ K L → C ¬B K → T

(b) T → B ¬B —————- ¬T K → T

¬K

L ∨ K

L

L → C

C

Hence my glasses are on the coffee table(C).

  1. Negate the following statements in English. Give a form other than simply putting ”not” or ”it is not the case that” in front:

(a) If it is sunny, I will go to the beach.

It is sunny but (and) I will not go to the beach.

(b) Someone has read every book in the library on this subject.

Everyone has not read some book in the library on this subject.

(c) Either it is raining, or it is snowing and the sun is shining.

It is not raining, and either it is not snowing or the sun is not shining.

(d) It is raining but the sun is shining. [16]

It is not raining or the sun is not shining.

  1. Translate the following wffs into English using the given predicates. The universe is the set of objects.[12]

H(x): x is healthy. P (x): x is happy. L(x, y): x likes y.

(a) ∀xH(x)

Everything is healthy.

(b) ¬∃x[H(x) ∧ P (x)]

There is nothing that is healthy and happy.

(c) ∀x[[H(x) ∧ P (x)] → ∃yL(y, x)]

For any object x, if x is healthy and happy, then there is something that likes x. In other words, something likes anything(everything) that is healthy and happy.

  1. Express the assertions given below as a proposition of a predicate logic using the following predicates. The universe is the set of objects.[16]