Problem 1.8 EC

Problem 1.8 EC - Problem 1.8 LPL EXTRA CRED I T R I K...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Problem 1.8 LPL EXTRA CRED I T R I K SENGUPTA 1. We would have the following atomic sentences: i. GaveScruffy(claire, claire) ii. GaveScruffy(max, claire) iii. GaveScruffy(claire, max) iv. GaveScruffy(max, max) v. GaveCarl(claire, claire) vi. GaveCarl(max, claire) vii. GaveCarl(claire, max) viii. GaveCarl(max, max) 2. The number of possible sentences can be easily determined. Since there are three variables x , y , and z , and each can take any of four values max, claire, scruffy and carl (repetitions allowed), the number of permutations possible is 4 3 = 64. To complete the answer, we would have the following atomic sentences: i. Gave(max, max, max) ii. Gave(max, max, claire) iii. Gave(max, max, scruffy) iv. Gave(max, max, carl) v. Gave(max, claire, max) vi. Gave(max, claire, claire) vii. Gave(max, claire, scruffy) viii. Gave(max, claire, carl) ix. Gave(max, scruffy, max) x. Gave(max, scruffy, claire) xi. Gave(max, scruffy, scruffy) xii. Gave(max, scruffy, carl) xiii. Gave(max, carl, max)...
View Full Document

Page1 / 4

Problem 1.8 EC - Problem 1.8 LPL EXTRA CRED I T R I K...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online