Originally Posted by

**XDemonoid** Ok, I need to convert an English sentence to predicate logic.

The domain is C , the set of Olympic competitors.

f(x,y) = x is faster than y

s(x,y) = x is the same person as y.

b(x,y) = x beats y

w(x) = x is the winner.

Translate the following English statements into precise symbolic notation. **Only use the predicates and domain defined above.**

1. There is exactly one fastest competitor.

2. If every competitor beats exactly one other competitor, then there is no winner.

Thank you guys