Skip to content
July 4, 2011 / porton

Funcoids and reloids between arbitrary sets

I decided to rewrite my theory of funcoids and reloids with funcoids and reloids defined between arbitrary sets instead of current theory which describes funcoids and reloids on a fixed set.

That way I will make funcoids and reloids into categories with objects being (small) sets and morphisms being funcoids and reloids.

That will make the manuscript a little longer, but that’s required for describing relations (such as Rudin-Keisler ordering and Rudin-Keisler equivalence and their generalizations) between filters and ultrafilters on different sets.

Leave a Reply

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

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

Google photo

You are commenting using your Google 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 )

Connecting to %s

This site uses Akismet to reduce spam. Learn how your comment data is processed.

%d bloggers like this: