English
Related papers

Related papers: W-Types with Reductions and the Small Object Argum…

200 papers

In this paper we investigate the construction of bicategories of fractions originally described by D. Pronk: given any bicategory $\mathcal{C}$ together with a suitable class of morphisms $\mathbf{W}$, one can construct a bicategory…

Category Theory · Mathematics 2016-04-21 Matteo Tommasini

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.…

Logic in Computer Science · Computer Science 2019-07-16 Benedikt Ahrens , Paolo Capriotti , Régis Spadotti

In this work we shall introduce a new model structure on the category of pro-simplicial sheaves, which is very convenient for the study of \'etale homotopy. Using this model structure we define a pro-space associated to a topos, as a result…

Algebraic Topology · Mathematics 2015-12-03 Ilan Barnea , Tomer M. Schlank

We fix any bicategory $\mathscr{A}$ together with a class of morphisms $\mathbf{W}_{\mathscr{A}}$, such that there is a bicategory of fractions $\mathscr{A}[\mathbf{W}_{\mathscr{A}}^{-1}]$. Given another such pair…

Category Theory · Mathematics 2014-11-24 Matteo Tommasini

We construct recursion categories from categories of coalgebras. Let $F$ be a nontrivial endofunctor on the category of sets that weakly preserves pullbacks and such that the category $\textbf{Set}_F$ of $F$-coalgebras is complete. The…

Category Theory · Mathematics 2007-05-23 Florian Lengyel

The study of Whittaker models for representations of reductive groups over local and global fields has become a central tool in representation theory and the theory of automorphic forms. However, only generic representations have Whittaker…

Representation Theory · Mathematics 2019-09-26 Dmitry Gourevitch , Siddhartha Sahi

We present new induction principles for the syntax of dependent type theories, which we call relative induction principles. The result of the induction principle relative to a functor F into the syntax is stable over the codomain of F. We…

Logic in Computer Science · Computer Science 2021-07-20 Rafaël Bocquet , Ambrus Kaposi , Christian Sattler

The homotopy category of a model structure on a weakly idempotent complete additive category is proved to be equivalent to the additive quotient of the category of cofibrant-fibrant objects with respect to the subcategory of…

Representation Theory · Mathematics 2025-01-28 Xue-Song Lu , Pu Zhang

To a finite group G one can associate a tower of wreath products S_n[G]. It is well known that the graded direct sum of the Grothendieck groups of the categories of finite dimensional complex representations of these groups can be given the…

Representation Theory · Mathematics 2014-10-21 Seth Shelley-Abrahamson

In the impredicative type theory of System F ({\lambda}2), it is possible to create inductive data types, such as natural numbers and lists. It is also possible to create coinductive data types such as streams. They work well in the sense…

Logic in Computer Science · Computer Science 2025-05-21 Steven Bronsveld , Herman Geuvers , Niels van der Weide

We give a definition of weakly sofic groups (w-sofic groups). Our definition is rather natural extension of the definition of sofic groups where instead of Hamming metric on symmetric groups we use general bi-invariant metrics on finite…

Group Theory · Mathematics 2008-09-09 Lev Glebsky , Luis Manuel Rivera Martinez

Finite covers are a technique for building new structures from simpler ones. The original motivation to study finite covers is in the Ladder theorem of Zilber which describes how totally categorical structures are built from strictly…

Logic · Mathematics 2007-06-13 Elisabetta Pastori

Higher inductive types are a class of type-forming rules, introduced to provide basic (and not-so-basic) homotopy-theoretic constructions in a type-theoretic style. They have proven very fruitful for the "synthetic" development of homotopy…

Logic · Mathematics 2020-07-08 Peter LeFanu Lumsdaine , Mike Shulman

The present note has three aims. First, to complement the theory of cofibrant generation of algebraic weak factorisation systems (AWFSs) to cover some important examples that are not locally presentable categories. Secondly, to prove that…

Category Theory · Mathematics 2019-01-23 Ignacio Lopez Franco

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…

Category Theory · Mathematics 2023-01-25 Raffael Stenzel

Subregular W-algebras are an interesting and increasingly important class of quantum hamiltonian reductions of affine vertex algebras. Here, we show that the $\mathfrak{sl}_{n+1}$ subregular W-algebra can be realised in terms of the…

Quantum Algebra · Mathematics 2022-10-14 Zachary Fehily

Homotopy Type Theory may be seen as an internal language for the $\infty$-category of weak $\infty$-groupoids which in particular models the univalence axiom. Voevodsky proposes this language for weak $\infty$-groupoids as a new foundation…

Category Theory · Mathematics 2019-02-20 Egbert Rijke , Bas Spitters

Weak (Hopf) bialgebras are described as (Hopf) bimonoids in appropriate duoidal (also known as 2-monoidal) categories. This interpretation is used to define a category wba of weak bialgebras over a given field. As an application, the "free…

Quantum Algebra · Mathematics 2013-10-22 Gabriella Böhm , José Gómez-Torrecillas , Esperanza López-Centella

We present a rich type system with subtyping for an extension of System F. Our type constructors include sum and product types, universal and existential quantifiers, inductive and coinductive types. The latter two size annotations allowing…

Logic in Computer Science · Computer Science 2017-07-12 Rodolphe Lepigre , Christophe Raffalli

We introduce constraints necessary for type checking a higher-order concurrent constraint language, and solve them with an incremental algorithm. Our constraint system extends rational unification by constraints x$\subseteq$ y saying that…

cmp-lg · Computer Science 2008-02-03 Martin Mueller , Joachim Niehren