Skip to content
August 21, 2013 / porton

Changed the definition of order of pointfree funcoids

In my preprint I defined pre-order of pointfree funcoids by the formula f\sqsubseteq g \Leftrightarrow [f]\subseteq[g]. Sadly this does not define a poset, but only a pre-order.

Recently I’ve found an other (non-equivalent) definition of an order on pointfree funcoids, this time this is a partial order not just a pre-order:

f \sqsubseteq g \Leftrightarrow \forall x \in \mathfrak{A}: \langle f \rangle  x \sqsubseteq \langle g \rangle x \wedge \forall y \in \mathfrak{B}: \langle  f^{- 1} \rangle y \sqsubseteq \langle g^{- 1} \rangle y.

I will systematically rewrite the relevant chapters of my manuscript to replace the old definition with the new one.

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: