You know, this could be a problem, coz languages have not developed with respect to describing highly abstract issues of special relationships. So I was thinking how to avoid Equivocation . . .
E is to Equivocation as ? is to the opposite of Equivocation.
It occurred to me that the symbol expressing the opposite of equivocation could be
[qimg]http://etc.usf.edu/clipart/41700/41756/FC_Exists_41756_mth.gif[/qimg]
Then there is other problem called Ambiguity. So I was thinking how to avoid Ambiguity . . .
A is to Ambiguity as ? is to the opposite of Ambiguity.
It occurred to me that the symbol expressing the opposite of ambiguity could be
[qimg]http://3.bp.blogspot.com/_Y1sq15aWr_M/SrqN287brRI/AAAAAAAAAPQ/WEl6gOxuoW4/s200/universal-quantifier-for-all.png[/qimg]
And so I got inspired and developed a special language, which is fallacy-proof. Here is an example.
[qimg]http://homepage.mac.com/markcc/logic-equivs.gif[/qimg]
Unfortunately, the language became very unpopular with the OM mathematicians who continue to use the expressive means inherited from
the cook-to-cook communication.