In a short (4 pages) article I define pointfree binary relations, a generalization of binary relations which does not use “points” (elements).

In a certain special case (of endo-relations) pointfree binary relations are essentially the same as binary relations.

It seems promising to research filters on sets of pointfree relations, generalizing the notion of reloids (that is filters on cartesian products) from my my research book

Leave a Reply

Your email address will not be published. Required fields are marked *