Universal algebra uniformly captures various algebraic structures, by expressing them as equational theories or abstract clones. The ubiquity of algebraic structures in mathematics and related fields has given rise to several variants of universal algebra, such as theories of symmetric operads, non-symmetric operads, generalised operads, PROPs, PROs, and monads. These variants of universal algebra are called notions of algebraic theory. In this paper, we develop a unified framework for them. The key observation is that each notion of algebraic theory can be identified with a monoidal category, in such a way that algebraic theories correspond to monoid objects therein. To incorporate semantics, we introduce a categorical structure called metamodel, which formalises a definition of models of algebraic theories. We also define morphisms between notions of algebraic theory, which are a monoidal version of profunctors. Every strong monoidal functor gives rise to an adjoint pair of such morphisms, and provides a uniform method to establish isomorphisms between categories of models in different notions of algebraic theory. A general structure-semantics adjointness result and a double categorical universal property of categories of models are also shown.
The framework by Avery @cite_3 is relative to a well-behaved 2-category (which he calls a ). In the basic setting of @math he identifies algebraic theories with identity-on-objects functor from a certain category @math of arities, calling them . In this case, the relationship to our work may be established by the fact that (putting size issues aside) identity-on-objects functors from @math correspond to monoid objects in @math (with the profunctor composition as the monoidal structure). This way we may understand Avery's framework (with respect to the setting @math ) within ours, although for general setting probably we cannot do so. However we remark that for specific examples of settings treated in @cite_3 , it seems that proto-theories therein can be identified with monoid objects in the category of a suitable variant of profunctors.
@cite_3
2742869180
Whereas formal category theory is classically considered within a @math -category, in this paper a double-dimensional approach is taken. More precisely we develop such theory within the setting of hypervirtual double categories, a notion extending that of virtual double category by adding cells with nullary target. [...] After this the notion of weak' Kan extension within a hypervirtual double category is considered, together with three strengthenings. [...] The notion of yoneda embedding is then considered in a hypervirtual double category, and compared to that of a good yoneda structure on a @math -category; the latter in the sense of Street-Walters and Weber. Conditions are given ensuring that a yoneda embedding @math defines @math as the free small cocompletion of @math , in a suitable sense. In the second half we consider formal category theory in the presence of algebraic structures. In detail: to a monad @math on a hypervirtual double category @math several hypervirtual double categories @math of @math -algebras are associated, [...]. This is followed by the study of the creation of, amongst others, left Kan extensions by the forgetful functors @math . The main motivation of this paper is the description of conditions ensuring that yoneda embeddings in @math lift along these forgetful functors, as well as ensuring that such lifted algebraic yoneda embeddings again define free small cocompletions, now in @math . As a first example we apply the previous to monoidal structures on categories, hence recovering Day convolution of presheaves and Im-Kelly's result on free monoidal cocompletion, as well as obtaining a "monoidal Yoneda lemma". The interleaving distance was originally defined in the field of Topological Data Analysis (TDA) by as a metric on the class of persistence modules parametrized over the real line. subsequently extended the definition to categories of functors on a poset, the objects in these categories being regarded as generalized persistence modules'. These metrics typically depend on the choice of a lax semigroup of endomorphisms of the poset. The purpose of the present paper is to develop a more general framework for the notion of interleaving distance using the theory of actegories'. Specifically, we extend the notion of interleaving distance to arbitrary categories equipped with a flow, i.e. a lax monoidal action by the monoid @math . In this way, the class of objects in such a category acquires the structure of a Lawvere metric space. Functors that are colax @math -equivariant yield maps that are @math -Lipschitz. This leads to concise proofs of various known stability results from TDA, by considering appropriate colax @math -equivariant functors. Along the way, we show that several common metrics, including the Hausdorff distance and the @math -norm, can be realized as interleaving distances in this general perspective. There are many category-theoretic notions of algebraic theory, including Lawvere theories, monads, PROPs and operads. The first central notion of this thesis is a common generalisation of these, which we call a proto-theory. In order to define models of a proto-theory in a category, we need a way of relating the arities of the proto-theory with the objects of the category. This leads to our second central notion, that of an interpretation of arities, or aritation for short. We show that every aritation gives rise to a semantics functor sending proto-theories to models. In fact this functor always has an adjoint, giving a structure-semantics adjunction. Furthermore, we show that the semantics of proto-theories generalises the classical semantics of many existing notions of algebraic theory. Another aim of this thesis is to find a convenient category of monads in the following sense. Every right adjoint gives rise to a monad on its codomain, and more generally so does any functor that admits a codensity monad. However, not all functors have codensity monads. This means that the semantics functor for monads on a category, viewed as a functor into the category of all functors into the base category, does not have a left adjoint. We seek a generalisation of monads with a semantics functor that does have a left adjoint. This can be accomplished with proto-theories, but at a cost. The classical semantics functor for monads is full and faithful; this is a kind of completeness theorem, and is highly desirable in a notion of algebraic theory. However, the semantics functor for general proto-theories is not full and faithful. Thus we seek a generalisation of monads and their semantics for which the semantics functor is both full and faithful and has a left adjoint. We show that such a generalisation is given, for suitable base categories, by a certain kind of topological proto-theory. Rewriting logic extends to concurrent systems with state changes the body of theory developed within the algebraic semantics approach. It is both a foundational tool and the kernel language of several implementation efforts (Cafe, ELAN, Maude). Tile logic extends (unconditional) rewriting logic since it takes into account state changes with side effects and synchronization. It is especially useful for defining compositional models of computation of reactive systems, coordination languages, mobile calculi, and causal and located concurrent systems. In this paper, the two logics are defined and compared using a recently developed algebraic specification methodology, membership equational logic. Given a theory T, the rewriting logic of T is the free monoidal 2-category, and the tile logic of T is the free monoidal double category, both generated by T. An extended version of monoidal 2-categories, called 2VH-categories, is also defined, able to include in an appropriate sense the structure of monoidal double categories. We show that 2VH-categories correspond to an extended version of rewriting logic, which is able to embed tile logic, and which can be implemented in the basic version of rewriting logic using suitable internal strategies. These strategies can be significantly simpler when the theory is uniform. A uniform theory is provided in the paper for CCS, and it is conjectured that uniform theories exist for most process algebras.