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


  • a precategory, whose objects are sets
  • product $latex \times$ of filters on sets ranging in morphisms of this category
  • operations $latex \mathrm{dom}$ and $latex \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 $latex \langle f\rangle$ for a funcoid $latex f$:

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

1 thought on “On a common generalization of funcoids and reloids

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

Leave a Reply

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