Related papers: An inductive-recursive universe generic for small …
We prove the conjecture that any Grothendieck $(\infty,1)$-topos can be presented by a Quillen model category that interprets homotopy type theory with strict univalent universes. Thus, homotopy type theory can be used as a formal language…
The Grothendieck universe axiom asserts that every set is a member of some set-theoretic universe U that is itself a set. One can then work with entities like the category of all U-sets or even the category of all locally U-small…
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…
This paper builds a cumulative tower of Grothendieck universes that provides a precise size discipline for higher type theory. Starting from an increasing sequence of inaccessible cardinals, we give an inductive-recursive definition of…
We record a particularly simple construction on top of Lumsdaine's local universes that allows for a Coquand-style universe of propositions with propositional extensionality to be interpreted in a category with subobject classifiers.
We prove a correspondence between $\kappa$-small fibrations in simplicial presheaf categories equipped with the injective or projective model structure (and left Bousfield localizations thereof) and relatively $\kappa$-compact maps in their…
We present an elaboration of inductive definitions down to a universe of datatypes. The universe of datatypes is an internal presentation of strictly positive families within type theory. By elaborating an inductive definition -- a…
A family of solutions of the Jacobi PDEs is investigated. This family is $n$-dimensional, of arbitrary nonlinearity and can be globally analyzed (thus improving the usual local scope of Darboux theorem). As an outcome of this analysis it is…
We construct a realizability model of linear dependent type theory from a linear combinatory algebra. Our model motivates a number of additions to the type theory. In particular, we add a universe with two decoding operations: one takes…
This paper proposes an interpretation of Grothendieck's geometric universes as a foundational framework for \emph{information networks}. We argue that Grothendieck topologies, sheaves, and topoi provide a sheaf-theoretic semantics in which…
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 type theories, universe hierarchies are commonly used to increase the expressive power of the theory while avoiding inconsistencies arising from size issues. There are numerous ways to specify universe hierarchies, and theories may…
This paper introduces an expressive class of indexed quotient-inductive types, called QWI types, within the framework of constructive type theory. They are initial algebras for indexed families of equational theories with possibly…
After reviewing the multiple roles of toposes - as generalized topological spaces, as universal invariants, as categorical analogues of the set-theoretic universe, and as semantic environments for first-order theories - we recall the notion…
We construct a univalent universe in the sense of Voevodsky in some suitable model categories for homotopy types (obtained from Grothendieck's theory of test categories). In practice, this means for instance that, appart from the homotopy…
We introduce a new method to construct a Grothendieck category from a given colored quiver. This is a variant of the construction used to prove that every partially ordered set arises as the atom spectrum of a Grothendieck category. Using…
We provide new families of minimal codes in any characteristic. Also, an inductive construction of minimal codes is presented.
Modalities in homotopy type theory are used to create and access subuniverses of a given type universe. These have significant applications throughout mathematics and computer science, and in particular can be used to create universes in…
We present a new coherence theorem for comprehension categories, providing strict models of dependent type theory with all standard constructors, including dependent products, dependent sums, identity types, and other inductive types.…
The conventional general syntax of indexed families in dependent type theories follow the style of "constructors returning a special case", as in Agda, Lean, Idris, Coq, and probably many other systems. Fording is a method to encode indexed…