Abstract
Assignments of weak orders to complete binary relations are considered. Firstly, it is shown that assigning the transitive closure of a complete binary relation does not always assign the closest weak order according to any reasonable metric on complete binary relations. It is then shown that the assignment of a weak order to a complete binary relation assigns its transitive closure if and only if it assigns the closest weak order according to a particular distance function that is not a metric. This permits more direct comparisons between the Transitive Closure Rule and other rules such as the Slater Rule.
Sign-in/Register to access full text options 
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.
