Related papers: Categories with dependent arrows
We consider sentence-definable and diagram-definable subfamilies of given families of theories, calculi for these subfamilies, as well dynamics and characteristics of these subfamilies with respect to rank and degree.
Modeling a sequence of design steps, or a sequence of parameter settings, yields a sequence of dynamical systems. In many cases, such a sequence is intended to approximate a certain limit case. However, formally defining that limit turns…
In this paper we raise the realisability problem in arrow categories. Namely, for a fixed category $\mathcal{C}$ and for arbitrary groups $H\le G_1\times G_2$, is there an object $\phi \colon A_1 \rightarrow A_2$ in…
There are several ways to construct omega-categories from combinatorial objects such as pasting schemes or parity complexes. We make these constructions into a functor on a category of chain complexes with additional structure, which we…
A computable structure $\mathcal{A}$ is decidable if, given a formula $\varphi(\bar{x})$ of elementary first-order logic, and a tuple $\bar{a} \in \mathcal{A}$, we have a decision procedure to decide whether $\varphi$ holds of $\bar{a}$. We…
We introduce a 3-dimensional categorical structure which we call intercategory. This is a kind of weak triple category with three kinds of arrows, three kinds of 2-dimensional cells and one kind of 3-dimensional cells. In one dimension, the…
Many of the properties of sectional category, topological complexity and homotopic distance are in fact derived from a small number of basic properties, which, once established, lead to all the others without further recourse to topology.…
We provide a necessary and sufficient condition for a simple object in a pivotal k-category to be ambidextrous. In turn, these objects imply the existence of nontrivial trace functions in the category. These functions play an important role…
We classify primitive, rank 1, omega-categorical structures having polynomially many types over finite sets. For a fixed number of 4-types, we show that there are only finitely many such structures and that all are built out of finitely…
We give a new description of computads for weak globular $\omega$-categories by giving an explicit inductive definition of the free words. This yields a new understanding of computads, and allows a new definition of $\omega$-category that…
Inspired by recent work of Aslanyan and Daw, we introduce the notion of $\Sigma$-orbits in the general framework of distinguished categories. In the setting of connected Shimura varieties, this concept contains many instances of…
We define a category $\mathsf{List}$ whose objects are sets and morphisms are mappings which assign to an element in the domain an ordered sequence (list) of elements in the codomain. We introduce and study a category of simplicial objects…
Team Semantics generalizes Tarski's Semantics by defining satisfaction with respect to sets of assignments rather than with respect to single assignments. Because of this, it is possible to use Team Semantics to extend First Order Logic via…
We present two Dialectica-like constructions for models of intensional Martin-L\"of type theory based on G\"odel's original Dialectica interpretation and the Diller-Nahm variant, bringing dependent types to categorical proof theory. We set…
Dependent pattern matching is a key feature in dependently typed programming. However, there is a theory-practice disconnect: while many proof assistants implement pattern matching as primitive, theoretical presentations give semantics to…
Automata learning is a technique that has successfully been applied in verification, with the automaton type varying depending on the application domain. Adaptations of automata learning algorithms for increasingly complex types of automata…
We study maximal independent families (m.i.f.) in the projective hierarchy. We show that (a) the existence of a $\boldsymbol{\Sigma}^1_2$ m.i.f. is equivalent to the existence of a $\boldsymbol{\Pi}^1_1$ m.i.f., (b) in the Cohen model,…
A type theory is presented that combines (intuitionistic) linear types with type dependency, thus properly generalising both intuitionistic dependent type theory and full linear logic. A syntax and complete categorical semantics are…
A dagger category is a category equipped with a functorial way of reversing morphisms, i.e. a contravariant involutive identity-on-objects endofunctor. Dagger categories with additional structure have been studied under different names e.g.…
We begin by explaining how any context-free grammar encodes a functor of operads from a freely generated operad into a certain "operad of spliced words". This motivates a more general notion of CFG over any category $C$, defined as a finite…