Related papers: A Syntax for Strictly Associative and Unital $\inf…
We show that any pasting diagram in any $(\infty,2)$-category has a homotopically unique composite. This is achieved by showing that the free 2-category generated by a pasting scheme is the homotopy colimit of its cells as an…
Many formal languages of contemporary mathematical music theory -- particularly those employing category theory -- are powerful but cumbersome: ideas that are conceptually simple frequently require expression through elaborate categorical…
Recent models of intensional type theory have been constructed in algebraic weak factorization systems (AWFSs). AWFSs give rise to comprehension categories that feature non-trivial morphisms between types; these morphisms are not used in…
We make explicit the correspondence between syntax and syntactic categories for coherent first-order logic, providing a categorical characterization of bi-interpretability. This is done by creating a biequivalence between a bicategory of…
Metatheorems about type theories are often proven by interpreting the syntax into models constructed using categorical gluing. We propose to use only sconing (gluing along a global section functor) instead of general gluing. The sconing is…
When working in Homotopy Type Theory and Univalent Foundations, the traditional role of the category of sets, Set, is replaced by the category hSet of homotopy sets (h-sets); types with h-propositional identity types. Many of the properties…
We use the terms "$\infty$-categories" and "$\infty$-functors" to mean the objects and morphisms in an "$\infty$-cosmos." Quasi-categories, Segal categories, complete Segal spaces, naturally marked simplicial sets, iterated complete Segal…
The treatment of equality as a type in type theory gives rise to an interesting type-theoretic structure known as `identity type'. The idea is that, given terms $a,b$ of a type $A$, one may form the type $Id_{A}(a,b)$, whose elements are…
Homotopy type theory is a new branch of mathematics which merges insights from abstract homotopy theory and higher category theory with those of logic and type theory. It allows us to represent a variety of mathematical objects as basic…
For a complete and cocomplete category $\mathcal{C}$ with a well-behaved class of `projectives' $\bar{\mathcal{P}}$, we construct a model structure on the category $s\mathcal{C}$ of simplicial objects in $\mathcal{C}$ where the weak…
The expression problem describes a fundamental tradeoff between two types of extensibility: extending a type with new operations, such as by pattern matching on an algebraic data type in functional programming, and extending a type with new…
Category theory unifies mathematical concepts, aiding comparisons across structures by incorporating objects and morphisms, which capture their interactions. It has influenced areas of computer science such as automata theory, functional…
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…
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 define a notion of "theory of (1,infty)-categories", and we prove that such a theory is unique up to equivalence.
We prove a result of equivalence invariance of formal category theory for statements that can be expressed within an equipment. To do this, we exploit Henry and Bardomiano Mart\'inez's link between Makkai's FOLDS (first order logic with…
A coextensive category can be defined as a category $\mathcal{C}$ with finite products such that for each pair $X,Y$ of objects in $\mathcal{C}$, the canonical functor $\times\colon X/\mathcal{C} \times Y/\mathcal{C} \to (X \times…
The introduction of first-class type classes in the Coq system calls for re-examination of the basic interfaces used for mathematical formalization in type theory. We present a new set of type classes for mathematics and take full advantage…
Theorem (after Giraud, SGA 4): Suppose $A$ is a simplicial category. The following conditions are equivalent: (i) There is a cofibrantly generated closed model category $M$ such that $A$ is equivalent to the Dwyer-Kan simplicial…
Coherence phenomena appear in two different situations. In the context of category theory the term `coherence constraints' refers to a set of diagrams whose commutativity implies the commutativity of a larger class of diagrams. In the…