Simple Laws about Nonprominent Properties of Binary Relations
Abstract
We checked each binary relation on a 5element set for a given set of properties, including usual ones like asymmetry and less known ones like Euclideanness. Using a poor man's QuineMcCluskey algorithm, we computed prime implicants of nonoccurring property combinations, like "not irreflexive, but asymmetric". We considered the nontrivial laws obtained this way, and manually proved them true for binary relations on arbitrary sets, thus contributing to the encyclopedic knowledge about less known properties.
 Publication:

arXiv eprints
 Pub Date:
 June 2018
 arXiv:
 arXiv:1806.05036
 Bibcode:
 2018arXiv180605036B
 Keywords:

 Mathematics  Logic;
 97E60
 EPrint:
 70 pages, 46 figures. Comparison to previous version: 9 more relation properties