Skip to content
November 24, 2015 / porton

Pointfree binary relations (a short article)

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

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

%d bloggers like this: