Related papers: Identity Types in Algebraic Model Structures and C…
For a given group $G$ and a collection of subgroups $\mathcal F$ of $G$, we show that there exist a left induced model structure on the category of right $G$-simplicial sets, in which the weak equivalences and cofibrations are the maps that…
In this paper, we introduce the following problem in the theory of algorithmic self-assembly: given an input shape as the seed of a tile-based self-assembly system, design a finite tile set that can, in some sense, uniquely identify whether…
The aim of this article is to give an expository account of the equivalence between modest sets and partial equivalence relations. Our proof is entirely self-contained in that we do not assume any knowledge of categorical realizability. At…
We summarize recent progress on the theory and applications of structural identifiability of compartmental models. On the applications side, we review identifiability analyses undertaken recently for models arising in epidemiology,…
Homotopy type theory is an interpretation of Martin-L\"of's constructive type theory into abstract homotopy theory. There results a link between constructive mathematics and algebraic topology, providing topological semantics for…
The category of Cartesian cubical sets is introduced and endowed with a Quillen model structure using ideas coming from recent constructions of cubical systems of univalent type theory.
The paper deals with combinatorial and stochastic structures of cubical token systems. A cubical token system is an instance of a token system, which in turn is an instance of a transition system. It is shown that some basic results of…
We introduce a new cubical model for homotopy types. More precisely, we'll define a category Qs with the following features: Qs is a PROP containing the classical box category as a subcategory, the category Qs-Set of presheaves of sets on…
We give a collection of results regarding path types, identity types and univalent universes in certain models of type theory based on presheaves. The main result is that path types cannot be used directly as identity types in any…
We begin by recalling the essentially global character of universes in various models of homotopy type theory, which prevents a straightforward axiomatization of their properties using the internal language of the presheaf toposes from…
We show that the classifying category C(T) of a dependent type theory T with axioms for identity types admits a non-trivial weak factorisation system. We provide an explicit characterisation of the elements of both the left class and the…
For a bialgebra $L$ coacting on a $\Bbbk$-algebra $A$, a classical result states that $A$ is a right $L$-comodule algebra if and only if $A$ is an algebra in the monoidal category $\mathcal{M}^{L}$ of right $L$-comodules; the former notion…
Type theories with multi-clocked guarded recursion provide a flexible framework for programming with coinductive types encoding productivity in types. Combining this with solutions to general guarded domain equations one can also construct…
We present general techniques for constructing functorial factorizations appropriate for model structures that are not known to be cofibrantly generated. Our methods use "algebraic" characterizations of fibrations to produce factorizations…
In the present paper we use the theory of exact completions to study categorical properties of small setoids in Martin-L\"of type theory and, more generally, of models of the Constructive Elementary Theory of the Category of Sets, in terms…
In proof theory the notion of canonical proof is rather basic, and it is usually taken for granted that a canonical proof of a sentence must be unique up to certain minor syntactical details (such as, e.g., change of bound variables). When…
By using a combination of algebraic, geometric, and dynamical techniques, together with input from higher dimensional Diophantine approximation, we give a complete characterization of all linearly repetitive cut and project sets with…
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…
We develop algebraic models of simple type theories, laying out a framework that extends universal algebra to incorporate both algebraic sorting and variable binding. Examples of simple type theories include the unityped and simply-typed…
We study the modular representation theory of the symmetric and alternating groups. One of the most natural ways to label the irreducible representations of a given group or algebra in the modular case is to show the unitriangularity of the…