Related papers: Logical Structure on Inverse Functor Categories
This paper provides an abstract definition of some kinds of logics, called diagrammatic logics, together with a definition of morphisms and of 2-morphisms between diagrammatic logics. The definition of the 2-category of diagrammatic logics…
We investigate the partial orderings of the form (P(X),\subset), where X is a relational structure and P(X) the set of the domains of its isomorphic substructures. A rough classification of countable binary structures corresponding to the…
A binary operation on any set induces a binary operation on its subsets. We explore families of subsets of a group that become a group under the induced operation and refer to such families as power groups of the given group. Our results…
We study a resource-sensitive fragment of the problem of extracting a logical discipline from a class of neural architectures by passing through categorization. The starting point is not a pre-existing logic but a category of zone-labelled…
This paper is an attempt to solve the following problem: given a logic, how to turn it into a paraconsistent one? In other words, given a logic in which \emph{ex falso quodlibet} holds, how to convert it into a logic not satisfying this…
Wiring diagrams usually serve as a tool in the study of arrangements of lines and pseudolines. In this paper we go in the opposite direction, using known properties of line arrangements to motivate certain equivalence relations and actions…
We want to replace categories, functors and natural transformations by categories, open functors and open natural transformations. In analogy with open dynamical systems, the adjective open is added here to mean that some external…
In this paper we develop an ideal structure theory for the class of left reductive regular semigroups and apply it to several subclasses of popular interest. In these classes we observe that the right ideal structure of the semigroup is…
Algebraic theories with dependency between sorts form the structural core of Martin-L\"of type theory and similar systems. Their denotational semantics are typically studied using categorical techniques; many different categorical…
Topologists are sometimes interested in space-valued diagrams over a given index category, but it is tricky to say what such a diagram even is if we look for a notion that is stable under equivalence. The same happens in (homotopy) type…
We prove that the category of directed graphs and graph maps carries a cofibration category structure in which the weak equivalences are the graph maps inducing isomorphisms on path homology.
Graph transformations definable in logic can be described using the notion of transductions. By understanding transductions as a basic embedding mechanism, which captures the possibility of encoding one graph in another graph by means of…
One goal of applied category theory is to understand open systems. We compare two ways of describing open systems as cospans equipped with extra data. First, given a functor $L \colon \mathsf{A} \to \mathsf{X}$, a "structured cospan" is a…
Causal diagrams are logic and graphical tools that depict assumptions about presumed causal relations. Such diagrams have proven effective in tackling a variety of problems in social sciences and epidemiology research yet remain foreign to…
We extend the logical categories framework to first order modal logic. In our modal categories, modal operators are applied directly to subobjects and interact with the background factorization system. We prove a Joyal-style representation…
Linear Programs (LP) are celebrated widely, particularly so in machine learning where they have allowed for effectively solving probabilistic inference tasks or imposing structure on end-to-end learning systems. Their potential might seem…
Twisted diagrams are "diagrams" with components in different categories. Structure maps are defined using auxiliary data which consists of functors relating the various categories to each other. Prime examples of the construction are…
We present some results on (co)limits of diagrams in $\infty$-categories, as well as those in $(n, 1)$-categories. In particular, we deduce a way to reshape colimit diagrams into simplicial ones, and a characterisations of $n$-cofinality…
For any ring $A$ and a small, preadditive, Hom-finite, and locally bounded category $Q$ that has a Serre functor and satisfies the (strong) retraction property, we show that the category of additive functors from $Q$ to the category of…
We present the basic ideas of forms (a generalization of Ehresmann's sketches) and their theories and models, more explicitly than in previous expositions. Forms provide the ability to specify mathematical structures and data types in any…