Finitary Cartesian closed varieties and semigroup actions
Mark V Lawson

TL;DR
This paper explores the relationship between matched pairs of Boolean algebras and monoids, and how their associated categories of sets can be represented through actions of Boolean left restriction monoids, linking algebraic structures to categorical frameworks.
Contribution
It demonstrates that categories of $[B|M]$-sets are equivalent to categories of $S$-actions, providing a new perspective on finitary Cartesian closed varieties via Boolean restriction monoids.
Findings
Categories of $[B|M]$-sets are equivalent to $S$-actions.
Every non-degenerate finitary Cartesian closed variety corresponds to a category of $S$-actions.
The structure of Boolean left restriction monoids underpins these categorical equivalences.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Advanced Algebra and Logic · Homotopy and Cohomology in Algebraic Topology
