CECS 228 Group Exercise 2 - Logic and Discrete Structures, Assignments of Discrete Structures and Graph Theory

The instructions and problems for group exercise 2 of cecs 228, a logic and discrete structures course. Students are required to complete problem 24 in section 1.2, which involves demonstrating the logical equivalence of p → (q → r) and p ∧ (q ∨ r) using a truth table and logical equivalences. In section 1.3, students are asked to define predicates c(x), d(x), and f(x), and express given statements using quantifiers and logical connectives. Lastly, students must translate system specifications into english using the predicate s(x, y) and the universe of discourse consisting of all systems and all possible states, respectively.

Typology: Assignments

Pre 2010

Uploaded on 08/19/2009

koofers-user-leu-1
koofers-user-leu-1 🇺🇸

10 documents

1 / 2

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
CECS 228 - Group Exercise 2 – Monday, 2/6/06
(Due on Wednesday, 2/8/06)
Group Name:_____________________________________________________________________
1. Problem 24 in Section 1.2 : Show that p ( q r) and q ( p r ) are logically equivalent by
a) Using a truth table
p | q | r |
-----------------------------------------------------------------------------------------------------------------------------
|||
|||
|||
|||
|||
|||
|||
|||
b) Applying known logical equivalences and laws
2. Problem 10 in Section 1.3
Define C(x) x has a cat”,
D(x)
F(x)
where the universe of discourse for variable x consists of ______________________________.
Express each of the following statements in terms of C(x), D(x), F(x), quantifiers, and logical
connectives.
continue on the other side
pf2

Partial preview of the text

Download CECS 228 Group Exercise 2 - Logic and Discrete Structures and more Assignments Discrete Structures and Graph Theory in PDF only on Docsity!

CECS 228 - Group Exercise 2 – Monday, 2/6/

(Due on Wednesday, 2/8/06)

Group Name :_____________________________________________________________________

1. Problem 24 in Section 1.2 : Show that  p  ( qr ) and q  ( pr ) are logically equivalent by a) Using a truth table p | q | r |


| | | | | | | | | | | | | | | | | | | | | | | | 

b) Applying known logical equivalences and laws 2. Problem 10 in Section 1. Define C ( x )  “ x has a cat”, D ( x )  F ( x )  where the universe of discourse for variable x consists of ______________________________. Express each of the following statements in terms of C ( x ), D ( x ), F ( x ), quantifiers, and logical connectives. continue on the other side

a) A student in your class has a cat, a dog, and a ferret. b) All students in your class have a cat, a dog, or a ferret. c) Some student in your class has a cat and a ferret, but not a dog. d) No student in your class has a cat, a dog, and a ferret. e) For each of the three animals, cats, dogs, and ferrets, there is a student in your class who has one of these animals as a pet.

3. Problem 36 in Section 1. Translate each of the following system specifications into English where the predicate S ( x , y ) is “ x is in state y ” and where the universe of discourse for x and y consists of all systems and all possible states, respectively. a)  x S ( x , open) b)  x ( S ( x , malfunctioning)  S ( x , diagnostic) ) c)  x S ( x , open)   x S ( x , diagnostic) d)  xS ( x , available) e)  xS ( x , working)