DOC PREVIEW
SC PHIL 110 - lesson 02 exercise key

This preview shows page 1 out of 2 pages.

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 2 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 2 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

LESSON 2 – PRACTICE EXERCISE KEYNOTE – Any homework exercises for this lesson not included below are gradeable by the software program and/or through the online Grade Grinder:1.7Orig 90 180 2701 F F F F2 F F F F3 T F F T4 F F T T5 T F F F6 F F T F1.8 Part 1 GaveScruffy(max,max)GaveScruffy(max, claire)GaveScruffy(claire,claire)GaveScruffy(claire,max)GaveCarl(max,max)GaveCarl(max, claire)GaveCarl(claire,claire)GaveCarl(claire,max)Part 264 (i.e., 43 or 4x4x4; that is, 4 names distributed over 3 argument positions)Part 3 4 names4 predicatesNote that you need to be sure that you understand the first two parts of the question above before you tackle Part 3. Part 1 deals with a language containing two relatively more complex binary predicates (GaveScruffy and GaveCarl) with fewer names (max and claire) than the other (second) language has. As noted above, this combination of predicates and names can produce 8 sentences.Part 2 asks you to compute the same sort of thing for the second language, which has just one ternary predicate (Gave) but more names (four of them: max, clair, scruffy, and carl). The point here is that the predicate Gave is more versatile than the predicates used with the first language, and that versatility allows you to generate more sentences to express more meanings in the second language than you could in the first. Indeed, since Gave is a ternary predicate, that means you have the potential of distributing four namesover three argument positions, or 4 to the third power (= 64 distinct sentences).Finally, Part 3 asks you to consider "a language like the first" (what they mean here is a language with binary predicates) and figure out how many binary predicates and names it would take to be able toexpress all 64 meanings that could be generated by the second language above. This different, third language (containing binary predicates only) would require 4 binary predicates (to be precise, GaveScruffy, GaveCarl, GaveMax, and GaveClaire) along with the 4 names max, clair, scruffy, and carl, in order to be able to express all 64 meanings expressible with the second language above.1.10 1. Max owned Scruffy at 2:00 (p.m., etc.)2. Max fed Scruffy at 2:303. Max gave Scruffy to Claire at 3:004. 2:00 is earlier than


View Full Document

SC PHIL 110 - lesson 02 exercise key

Documents in this Course
Load more
Download lesson 02 exercise key
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view lesson 02 exercise key and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view lesson 02 exercise key 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?