A Cartesian monoid is a monoid , with additional structure of pairing and projection operators. It was first formulated by Dana Scott and Joachim Lambek independently.
Definition
A Cartesian monoid is a structure with signature
⟨
∗
,
e
,
(
−
,
−
)
,
L
,
R
⟩
{\displaystyle \langle *,e,(-,-),L,R\rangle }
where
∗
{\displaystyle *}
and
(
−
,
−
)
{\displaystyle (-,-)}
are binary operations ,
L
,
R
{\displaystyle L,R}
, and
e
{\displaystyle e}
are constants satisfying the following axioms for all
x
,
y
,
z
{\displaystyle x,y,z}
in its universe :
Monoid
∗
{\displaystyle *}
is a monoid with identity
e
{\displaystyle e}
Left Projection
L
∗
(
x
,
y
)
=
x
{\displaystyle L*(x,\,y)=x}
Right Projection
R
∗
(
x
,
y
)
=
y
{\displaystyle R*(x,\,y)=y}
Surjective Pairing
(
L
∗
x
,
R
∗
x
)
=
x
{\displaystyle (L*x,\,R*x)=x}
Right Homogeneity
(
x
∗
z
,
y
∗
z
)
=
(
x
,
y
)
∗
z
{\displaystyle (x*z,\,y*z)=(x,\,y)*z}
The interpretation is that
L
{\displaystyle L}
and
R
{\displaystyle R}
are left and right projection functions respectively for the pairing function
(
−
,
−
)
{\displaystyle (-,-)}
.
References
Statman, Rick (1997), "On Cartesian monoids", Computer science logic (Utrecht, 1996) , Lecture Notes in Computer Science , vol. 1258, Berlin: Springer, pp. 446–459, doi :10.1007/3-540-63172-0_55 , MR 1611514 .
Category :
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.
**DISCLAIMER** We are not affiliated with Wikipedia, and Cloudflare.
The information presented on this site is for general informational purposes only and does not constitute medical advice.
You should always have a personal consultation with a healthcare professional before making changes to your diet, medication, or exercise routine.
AI helps with the correspondence in our chat.
We participate in an affiliate program. If you buy something through a link, we may earn a commission 💕
↑