Posted by **Tim** on Friday, February 27, 2009 at 10:25pm.

I need help on Quantifier logic problems?

Using the symbolization key given, symbolize each sentence in QL.

Universal Discourse: animals

Dx: x is a puppy

Hx: x is lost

Tx: is a Terrier

Fxy: x can run faster than y

r: Tim

1.No puppy can run faster than Tim.

2. No animal is faster than itself

3. Some puppies are Terriers and some are not.

4. There is a puppy who is not a Terrier but is faster than any Terrier

5. For every puppy, there is some animal that is faster.

Here is my attempt:I'm uncertain about question 1 and 4 and I need more clarification on those.

1. ~∀x(Dx --> Frx)

2. ~∃xFxx

3. ∃x[(Dx & Tx) & (Dx & ~Tx)]

4. ∃x[(Dx & ~Tx) & ∀yFxy]

5. x(Dx--> ∃yFxy)

## Answer this Question

## Related Questions

- discrete math - Express the quantification: Existential(!)x P(x) using universal...
- Logic - Are there advantages of modern symbolic logic over classical logic (...
- discrete mathematics - problem has to do with three valued logic, ie the values ...
- Phil103 Informal Logic - 1. Question : "~ P v Q" is best read as Student Answer...
- PRINCIPLES OF PROGRAMMING LOGIC - HOW CAN I DRAW A FLOWCHART THAT WILL PRODUCE ...
- Programming Logic - How do I write case logic pseudocode and visual logic nested...
- Logic and Design - I need help with pseudocode, and any help regarding forming ...
- PHI103: Informal Logic - 1) In the truth table for an invalid argument, Student ...
- logic - ic Logic Write two arguments in English, one in the form of modus ponens...
- programming logic and design - need help on creating a logic for a program that ...

More Related Questions