Braided logic: the simplest models (Q5932504)

A braided logic is, by definition, an equational logic (a language with axioms) containing the Artin braid axiom. A language is defined as a functor from a category of alphabets to a category of free operads (clones, algebras of terms, operads of words,\dots). A collection \(G_0\) of \(0\)-cells is a free monoid generated by a singleton \(0\)-cell. A model of a \(1\)-cell \(\in G_1\) is a functor or a concrete operation. A model of a \(2\)-cell \(\in G_2\) is a natural transformation of functors. An alphabet of \(1\)-cells is generated by grafting a free operad of derived \(1\)-cells and an alphabet of \(2\)-cells of \(G_2\) expands to \(2\)-cells among grafted \(1\)-cells. A \(2\)-cell \(f\in \text{nat}(\alpha,\beta)\) is said to be of type \((\alpha,\beta)\), if the corresponding alphabet of \(1\)-cells consists exactly of two letters \(\alpha\) and \(\beta\). A model of an abstract operation \(f\in \text{nat}(\alpha,\beta)\) is a gebra of type \((\alpha,\beta)\) (shortly \((\alpha,\beta)\)-gebra), i.e., a pair \((A,fA)\) consisting of an object \(A\) and a \(1\)-morphism \(fA:\alpha A\to \beta A\) (a \(\beta A\)-valued operation on \(A\)). The family of all gebras of a given type is an \((\alpha,\beta)\)-category. The categories of \((\alpha,\text{id})\)-gebras, \((\text{id},\gamma)\)-gebras, and \((\tau,\tau)\)-gebras, respectively, are equivalent, where \(\text{id}\in G_1\) is some identity \(1\)-cell. In this paper equational classes of ``braided'' gebras in a category of type \((\tau,\tau)\) are studied as a possible alternative to the classical equational classes of type \((\alpha,\text{id})\). The main result is the proof that on a two-element set there are exactly 43 models of the Artin braid axiom \[ (\text{id}\times \sigma)\circ (\sigma\times \text{id})\circ(\text{id}\times \sigma)= (\sigma\times \text{id})\circ (\text{id}\times\sigma)\circ (\sigma\times \text{id})\quad (\sigma\equiv (\alpha,\beta)\in (2\mapsto 2)) \] among 256 possible operations of type \((2\mapsto 2)\).