Related papers: Naturality for higher-dimensional path types
Abstract axiomatic formulation of mathematical structures are extensively used to describe our physical world. We take here the reverse way. By making basic assumptions as starting point, we reconstruct some features of both geometry and…
We show that the category of N-complexes has a Str\om model structure, meaning the weak equivalences are the chain homotopy equivalences. This generalizes the analogous result for the category of chain complexes (N = 2). The trivial objects…
We show how polynomial path orders can be employed efficiently in conjunction with weak innermost dependency pairs to automatically certify polynomial runtime complexity of term rewrite systems and the polytime computability of the…
The goal of this paper is to address the problem of building a path object for the category of Grothendieck (weak) $\infty$-groupoids. This is the missing piece for a proof of Grothendieck's homotopy hypothesis. We show how to endow the…
We develop a categorical and algebro-geometric treatment of localization for cohomological theories endowed with an open--closed recollement. Starting from a class on a space whose restriction to the open complement vanishes, we show that…
For all classical groups (and for their analogs in infinite dimension or over general base fields or rings) we construct certain contractions, called "homotopes". The construction is geometric, using as ingredient involutions of associative…
For all classical groups (and for their analogs in infinite dimension or over general base fields or rings) we construct certain contractions, called "homotopes". The construction is geometric, using as ingredient involutions of associative…
Motivated by the Grothendieck construction, we study the functorialities of the comma construction for strict $\omega$-categories. To state the most general functorialities, we use the language of Gray $\omega$-categories, that is,…
By extending type theory with a universe of definitionally associative and unital polynomial monads, we show how to arrive at a definition of opetopic type which is able to encode a number of fully coherent algebraic structures. In…
In combinatorics, the probabilistic method is a very powerful tool to prove the existence of combinatorial objects with interesting and useful properties. Explicit constructions of objects with such properties are often very difficult, or…
We prove a conjecture about the constructibility of coinductive types - in the principled form of indexed M-types - in Homotopy Type Theory. The conjecture says that in the presence of inductive types, coinductive types are derivable.…
We present a soundness theorem for a dependent type theory with context constants with respect to an indexed category of (finite, abstract) simplical complexes. The point of interest for computer science is that this category can be seen to…
We offer a criterion for showing that the automorphism group of an ultrahomogeneous structure is topologically 2-generated and even has a cyclically dense conjugacy class. We then show how finite topological rank of the automorphism group…
Most categorical models for dependent types have traditionally been heavily set based: contexts form a category, and for each we have a set of types in said context -- and for each type a set of terms of said type. This is the case for…
In our recent papers [Sh1,2], we introduced a {\it twisted tensor product} of dg categories, and provided, in terms of it, {\it a contractible 2-operad $\mathcal{O}$}, acting on the category of small dg categories, in which the "natural…
In classical set theory, there are many equivalent ways to introduce ordinals. In a constructive setting, however, the different notions split apart, with different advantages and disadvantages for each. We consider three different notions…
Martin-L\"of's Intuitionistic Theory of Types is becoming popular for formal reasoning about computer programs. To handle recursion schemes other than primitive recursion, a theory of well-founded relations is presented. Using primitive…
One of the open problems in higher category theory is the systematic construction of the higher dimensional analogues of the Gray tensor product. In this paper we continue the work of [7] to adapt the machinery of globular operads [4] to…
Reynolds' parametricity originally equips types with proof-irrelevant binary propositional relations over the types. But such relations can also be taken proof-relevant or unary, and described either in an indexed or fibred way.…
We define a functor which takes in an $(\infty,1)$-category and outputs an $(\omega,1)$-category, the natural maximally "strict" version of an $(\infty,1)$-category. We do this by modeling $(\infty,1)$-categories as categories enriched in…