Related papers: Modal Dependent Type Theory and Dependent Right Ad…

We first generalize the logarithmic tensor category theory of Huang-Lepowsky-Zhang to the more general case that the module category for a vertex operator algebra $V$ (more generally a M\"{o}bius vertex algebra) might not be closed under…

This paper introduces an expressive class of quotient-inductive types, called QW-types. We show that in dependent type theory with uniqueness of identity proofs, even the infinitary case of QW-types can be encoded using the combination of…

I introduce modal group theory, in which we study the category of all groups, considering embeddability as providing a notion of modal possibility. Using HNN extensions and Britton's lemma, I demonstrate that the modal language of groups is…

A Datalog program can be viewed as a syntactic specification of a functor from database instances over some schema to database instances over another schema. The same holds more generally for $\exists$Datalog. We establish large classes of…

For a classical group $G$ of type $\mathsf D_n$ over a field $k$ of characteristic different from $2$, we show the existence of a finitely generated regular extension $R$ of $k$ such that $G$ admits outer automorphisms over $R$. Using this…

Quantum resource theory is a cutting-edge tool used to study practical implementations of quantum mechanical principles under realistic operational constraints. It does this by modelling quantum systems as restricted classes of possible or…

We show that a braided monoidal category C can be endowed with the structure of a right (and left) module category over C \times C. In fact, there is a family of such module category structures, and they are mutually isomorphic if and only…

We study fragments of dependence logic defined either by restricting the number k of universal quantifiers or the width of dependence atoms in formulas. We find the sublogics of existential second-order logic corresponding to these…

We study the dependent type theory CaTT, introduced by Finster and Mimram, which presents the theory of weak $\omega$-categories, following the idea that type theories can be considered as presentations of generalized algebraic theories.…

In this paper, we establish some finiteness results about the multiplicative dependence of rational values modulo sets which are `close' (with respect to the Weil height) to division groups of finitely generated multiplicative groups of a…

This article tackles categorical coherence within a two-dimensional generalization of Lawvere's functorial semantics. 2-theories, a syntactical way of describing categories with structure, are presented. From the perspective here afforded,…

Let $A$ be a finite-dimensional algebra over a field $k$. We define $A$ to be $\mathbf{C}$-dichotomic if it has the dichotomy property of the representation type on complexes of projective $A$-modules. $\mathbf{C}$-dichotomy implies the…

We introduce judgemental theories and their calculi as a general framework to present and study deductive systems. As an exemplification of their expressivity, we approach dependent type theory and natural deduction as special kinds of…

This paper presents a construction which transforms categorical models of additive-free propositional linear logic, closely based on de Paiva's dialectica categories and Oliva's functional interpretations of classical linear logic. The…

We study the subcategory of topological operads $P$ such that $P(0) = *$ (the category of unitary operads in our terminology). We use that this category inherits a model structure, like the category of all operads in topological spaces, and…

Let $A$ be a commutative algebra in a braided monoidal category $\mathcal{C}$; e.g., $A$ could be an extension of a vertex operator algebra (VOA) $V$ in a category $\mathcal{C}$ of $V$-modules. We study when the category $\mathcal{C}_A$ of…

We present the guarded lambda-calculus, an extension of the simply typed lambda-calculus with guarded recursive and coinductive types. The use of guarded recursive types ensures the productivity of well-typed programs. Guarded recursive…

We define a general class of dependent type theories, encompassing Martin-L\"of's intuitionistic type theories and variants and extensions. The primary aim is pragmatic: to unify and organise their study, allowing results and constructions…

By operations on models we show how to relate completeness with respect to permissive-nominal models to completeness with respect to nominal models with finite support. Models with finite support are a special case of permissive-nominal…

Let Q be a finite quiver without oriented cycles, and let k be an algebraically closed field. The main result in this paper is that there is a natural bijection between the elements in the associated Coxeter group W_Q and the cofinite…