Skip to content
January 16, 2014 / porton

On a common generalization of funcoids and reloids

Just a few seconds ago I had an idea how to generalize both funcoids and reloids.

Consider

  • a precategory, whose objects are sets
  • product \times of filters on sets ranging in morphisms of this category
  • operations \mathrm{dom} and \mathrm{im} from the morphisms of our precategory to filters on our objects (sets)

This axiomatic system is so powerful that it allows to define \langle f\rangle for a funcoid f:

\langle f\rangle\mathcal{X} = \mathrm{im}(f\circ(1^\mathfrak{F}\times^\mathsf{FCD}\mathcal{X})).

Advertisements

One Comment

Leave a Comment
  1. porton / Jan 16 2014 01:25

    However this axiomatic system is probably too weak to prove \langle g\rangle\langle f\rangle\mathcal{X} = \langle g\circ f\rangle\mathcal{X}. We need additional axioms.

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: