1. ## Relation Problem

Here's what the problem says:

"Let F,G: B<->C be two relations. Prove: If F is total, G is determinate, and F G, then G F.
Hint: If you use quantifiers, you can, for any b:B, use instantiation for ∀ (9.13) on the predicate-logic definition of totality of F."

Seeing as how I have not a single clue on this green earth what as to what this question is asking, any help is greatly appreciated.

2. ## Re: Relation Problem

Originally Posted by RobertXIV
Here's what the problem says:
"Let F,G: B<->C be two relations. Prove: If F is total, G is determinate, and F G, then G F.
Hint: If you use quantifiers, you can, for any b:B, use instantiation for ∀ (9.13) on the predicate-logic definition of totality of F."
Seeing as how I have not a single clue on this green earth what as to what this question is asking, any help is greatly appreciated.
I hope this is some reconciliation to you. I taught this material for over thirty years, but I have no idea what that question means.

3. ## Re: Relation Problem

well.. hell.
Thanks a lot for the reply. It does actually reconcile me slightly with the subject .

4. ## Re: Relation Problem

[rant]
'Not to give into my OCD tendencies but
heckheckheckheckheckheckheckheckheckheckheckheckhe ckheckheckheckheckheckheckheckheckheckheckheckheck heckheckheckheckheck
[/rant]

-Dan