Related papers: Elementwise semantics in categories with pull-back…
We firstly prove the completeness of the category of crossed modules in a modified category of interest. Afterwards, we define pullback crossed modules and pullback cat$^1$-objects that are both obtained by pullback diagrams with extra…
This is a report on aspects of the theory and use of monoidal categories. The first section introduces the main concepts through the example of the category of vector spaces. String notation is explained and shown to lead naturally to a…
The purpose of this note is to work out the details of the concrete incarnation of a few categorical constructions (products, coproducts, pullbacks, pushouts, equalizers, coequalizers, and exponentials) in some useful and basic categories:…
Recall that the definition of the $K$-theory of an object C (e.g., a ring or a space) has the following pattern. One first associates to the object C a category A_C that has a suitable structure (exact, Waldhausen, symmetric monoidal, ...).…
We introduce a new semantics for justification logic based on subset relations. Instead of using the established and more symbolic interpretation of justifications, we model justifications as sets of possible worlds. We introduce a new…
Let $A$ be an algebra over an operad in a cocomplete closed symmetric monoidal category. We study the category of $A$-modules. We define certain symmetric product functors of such modules generalising the tensor product of modules over…
The study of complex systems through the lens of category theory consistently proves to be a powerful approach. We propose that cognition deserves the same category-theoretic treatment. We show that by considering a highly-compact cognitive…
A logic is defined that allows to express information about statistical probabilities and about degrees of belief in specific propositions. By interpreting the two types of probabilities in one common probability space, the semantics given…
For classical dynamical systems, the polynomial entropy serves as a refined invariant of the topological entropy. In the setting of categorical dynamical systems, that is, triangulated categories endowed with an endofunctor, we develop the…
Categories are coreflectively embedded in multicategories via the "discrete cocone" construction, the right adjoint being given by the monoid construction. Furthermore, the adjunction lifts to the "cartesian level": preadditive categories…
This paper is concerned with categorical structures for reversible computation. In particular, we focus on a typed, functional reversible language based on Theseus. We discuss how join inverse rig categories do not in general capture…
We introduce a class dynamical systems called $G$-systems equipped with a coupling operation. We use $G$-systems to define the notions of dependence (borrowed from dependence logic) and causality (borrowed from Pearl) for dynamical systems.…
We define and study logics in the framework of probabilistic team semantics and over metafinite structures. Our work is paralleled by the recent development of novel axiomatizable and tractable logics in team semantics that are closed under…
The proof theory and semantics of intuitionistic modal logics have been studied by Simpson in terms of Prawitz-style labelled natural deduction systems and Kripke models. An alternative to model-theoretic semantics is provided by…
The classification of events involving jets as signal-like or background-like can depend strongly on the jet algorithm used and its parameters. This is partly due to the fact that standard jet algorithms yield a single partition of the…
A theory of how agents can come to understand a language is presented. If understanding a sentence $\alpha$ is to associate an operator with $\alpha$ that transforms the representational state of the agent as intended by the sender, then…
In this paper we define the triangulated category of motives over a simplicial scheme. The morphisms between the Tate objects in this category compute the motivic cohomology of the underlying scheme. In the last section we consider the…
Conventional jet algorithms are based on a deterministic view of the underlying hard scattering process. Each outgoing parton from the hard scattering is associated with a hard, well separated jet. This approach is very successful because…
Motivated by its links to $\tau$-tilting theory, we introduce a generalization of cotorsion pairs in module categories. Such pairs are also linked to co-t-structures in corresponding triangulated categories, and to cotorsion pairs in…
In this paper, we provide an interpretation of the existing reduction process for extriangulated categories in general. This process allows us to obtain a new category which, for well-known cases, admits a triangulated structure. We will…