相关论文: An inductive-recursive universe generic for small …

Homotopy Type Theory with a univalent universe $\,\mathcal{U}_0$ is interpreted at the strength of finite order arithmetic. We eliminate Grothendieck universes, avoid the axiom of replacement, and bound all uses of separation.

In this paper we investigate an infinitely categorical analogue of the theory of Grothendieck topoi. In particular, we define infinity topoi and prove an analogue of Giraud's theorem, expressing the equivalence of ``intrinsic'' and…

We classify simple representations of Khovanov-Lauda-Rouquier algebras in finite type. The classification is in terms of a standard family of representations that is shown to yield the dual PBW basis in the Grothendieck group. Finally, we…

Let $\mathcal{G}$ be a Grothendieck category. We prove completeness of the Gorenstein injective cotorsion pair whenever $\mathcal{G}$ admits a set of Tate trivial generators, and show that having such generators is necessary for…

Hofmann and Streicher famously showed how to lift Grothendieck universes into presheaf topoi, and Streicher has extended their result to the case of sheaf topoi by sheafification. In parallel, van den Berg and Moerdijk have shown in the…

It is known that, in univalent mathematics, type universes, the type of $n$-types in a universe, reflective subuniverses, and the underlying type of any algebra of the lifting monad are all (algebraically) injective. Here, we further show…

Logical frameworks can be used to translate proofs from a proof system to another one. For this purpose, we should be able to encode the theory of the proof system in the logical framework. The Lambda Pi calculus modulo theory is one of…

In this short note, we classify linear categorified open topological field theories in dimension two by pivotal Grothendieck-Verdier categories, a type of monoidal category equipped with a weak, not necessarily rigid duality. In combination…

Let $k$ be a field that is finitely generated over its prime field. In Grothendieck's anabelian letter to Faltings, he conjectured that sending a $k$-scheme to its \'{e}tale topos defines a fully faithful functor from the localization of…

Cubical type theory provides a constructive justification to certain aspects of homotopy type theory such as Voevodsky's univalence axiom. This makes many extensionality principles, like function and propositional extensionality, directly…

We study the properties of the constructible universe, L, over intuitionistic theories. We give an extended set of fundamental operations which is sufficient to generate the universe over Intuitionistic Kripke-Platek set theory without…

We give a characterizations of toposes which admit a generating family of objects which are internally cardinal finite (i.e. Kuratowski finite and decidable) in terms of "topological" conditions. The central result is that, constructively,…

Given an infinity-category C, one can naturally construct an infinity-category Fam(C) of families of objects in C indexed by infinity-groupoids. An ordinary categorical version of this construction was used by Borceux and Janelidze in the…

A generalization of topos theory is proposed giving an abstract realization of such categories as, say, the categories of manifolds and of Grothendieck schemes on the one hand, and permitting one, on the other hand, a view on…

A generic method for combinatorial constructions of intrinsic geometrical spaces is presented. It is based on the well known inverse sequences of finite graphs that determine (in the limit) topological spaces. If a pattern of the…

After surveying classical results, we introduce a generalized notion of inference system to support structural recursion on non-well-founded data types. Besides axioms and inference rules with the usual meaning, a generalized inference…

We define a notion on preadditive categories which plays a role similar to the notion of a Grothendieck pretopology on an unenriched category. Each such additive pretopology defines an additive Grothendieck topology and suffices to define…

Native type systems are those in which type constructors are derived from term constructors, as well as the constructors of predicate logic and intuitionistic type theory. We present a method to construct native type systems for a broad…

We expand the theory of 2-classifiers, that are a 2-categorical generalization of subobject classifiers introduced by Weber. The idea is to upgrade monomorphisms to discrete opfibrations. We prove that the conditions of 2-classifier can be…

Postulating an impredicative universe in dependent type theory allows System F style encodings of finitary inductive types, but these fail to satisfy the relevant {\eta}-equalities and consequently do not admit dependent eliminators. To…