paper

Finitary Cartesian closed varieties and semigroup actions

arXiv:2602.19904

Abstract

We build on some ideas of Richard Garner. Let be a monoid and a Boolean algebra. A `matched pair' consists of and and some mutual interactions. Garner showed that every such matched pair determines (what we shall call) a Boolean left restriction monoid . In this paper, we show that the data of a -set (defined later) may be encoded by means of a certain kind of action by . This means that the category -{\bf sets} is equivalent to a category of {\bf -actions}. We deduce, as a result of Garner's work, that every non-degenerate finitary Cartesian closed variety is equivalent to a special category of -actions where is a Boolean left restriction monoid.

Finitary Cartesian closed varieties and semigroup actions · wovepaper