Abstract
The aim of this paper is to explain the fact that certain properties of binary relations are frequently observed in natural language while others do not appear at all. Three features of binary relation are studied : (i) the ability to use the relation to indicate nameless elements ; (ii) the accuracy with which the vocabulary spanned by the relation can be used to approximate the actual terms to which a user of the language wishes to refer ; (iii) the ease with which the relation can be described by means of examples. It is argued that linear orderings are optimal according to the first criteria while asymmetric relations are optimal according to the second. From among complete and asymmetric relations (tournaments), those which are transitive are optimal according to the third criterion.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
