English
Related papers

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

200 papers

Graded Type Theory provides a mechanism to track and reason about resource usage in type systems. In this paper, we develop GraD, a novel version of such a graded dependent type system that includes functions, tensor products, additive…

Programming Languages · Computer Science 2021-01-07 Pritam Choudhury , Harley Eades , Richard A. Eisenberg , Stephanie C Weirich

The additivity theorem for derivateurs associated to complicial biWaldhausen categories is proved. Also, to any exact category in the sense of Quillen a K-theory space is associated. This K-theory is shown to satisfy the additivity,…

K-Theory and Homology · Mathematics 2007-05-23 Grigory Garkusha

We extend Homotopy Type Theory with a novel modality that is simultaneously a monad and a comonad. Because this modality induces a non-trivial endomap on every type, it requires a more intricate judgemental structure than previous modal…

Category Theory · Mathematics 2021-02-09 Mitchell Riley , Eric Finster , Daniel R. Licata

We present a family of minimal modal logics (namely, modal logics based on minimal propositional logic) corresponding each to a different classical modal logic. The minimal modal logics are defined based on their classical counterparts in…

Logic in Computer Science · Computer Science 2025-08-13 Tiziano Dalmonte

Let $\mathcal{A}$ be a completely rational local M\"obius covariant net on $S^1$, which describes a set of chiral observables. We show that local M\"obius covariant nets $\mathcal{B}_2$ on 2D Minkowski space which contains $\mathcal{A}$ as…

Mathematical Physics · Physics 2017-06-23 Marcel Bischoff , Yasuyuki Kawahigashi , Roberto Longo

We review the construction of braided tensor categories and modular tensor categories from representations of vertex operator algebras, which correspond to chiral algebras in physics. The extensive and general theory underlying this…

High Energy Physics - Theory · Physics 2015-06-15 Yi-Zhi Huang , James Lepowsky

We introduce a two-sort weighted modal logic for possibilistic reasoning with fuzzy formal contexts. The syntax of the logic includes two types of weighted modal operators corresponding to classical necessity ($\Box$) and sufficiency…

Logic in Computer Science · Computer Science 2026-01-01 Prosenjit Howlader , Churn-Jung Liau

We introduce proper display calculi for basic monotonic modal logic, the conditional logic CK and a number of their axiomatic extensions. These calculi are sound, complete, conservative and enjoy cut elimination and subformula property. Our…

The program of internal type theory seeks to develop the categorical model theory of dependent type theory using the language of dependent type theory itself. In the present work we study internal homotopical type theory by relaxing the…

Logic in Computer Science · Computer Science 2025-08-08 Joshua Chen

We construct generalized multicategories associated to an arbitrary operad in Cat that is $\Sigma$-free. The construction generalizes the passage to symmetric multicategories from permutative categories, which is the case when the operad is…

Category Theory · Mathematics 2015-02-18 A. D. Elmendorf

We present a complete logic for reasoning with functional dependencies (FDs) with semantics defined over classes of commutative integral partially ordered monoids and complete residuated lattices. The dependencies allow us to express…

Databases · Computer Science 2015-07-07 Vilem Vychodil

Inspired by the study of vertex operator algebra extensions, we answer the question of when the category of local modules over a commutative exact algebra in a braided finite tensor category is a (non-semisimple) modular tensor category.…

Quantum Algebra · Mathematics 2025-12-24 Kenichi Shimizu , Harshit Yadav

Propositional term modal logic is interpreted over Kripke structures with unboundedly many accessibility relations and hence the syntax admits variables indexing modalities and quantification over them. This logic is undecidable, and we…

Logic in Computer Science · Computer Science 2019-01-01 Anantha Padmanabha , R Ramanujam

We develop semantics and syntax for bicategorical type theory. Bicategorical type theory features contexts, types, terms, and directed reductions between terms. This type theory is naturally interpreted in a class of structured…

Logic in Computer Science · Computer Science 2023-10-13 Benedikt Ahrens , Paige Randall North , Niels van der Weide

Proof assistants and programming languages based on type theories usually come in two flavours: one is based on the standard natural deduction presentation of type theory and involves eliminators, while the other provides a syntax in…

Logic in Computer Science · Computer Science 2015-07-30 Nicolas Guenot , Daniel Gustafsson

We show that the classifying category C(T) of a dependent type theory T with axioms for identity types admits a non-trivial weak factorisation system. We provide an explicit characterisation of the elements of both the left class and the…

Logic · Mathematics 2008-11-10 Nicola Gambino , Richard Garner

Using the theory of coalgebra, we introduce a uniform framework for adding modalities to the language of propositional geometric logic. Models for this logic are based on coalgebras for an endofunctor on some full subcategory of the…

Logic · Mathematics 2023-06-22 Nick Bezhanishvili , Jim de Groot , Yde Venema

In the theory of operads we consider functors of generalized symmetric powers defined by sums of coinvariant modules under actions of symmetric groups. One observes classically that the construction of symmetric functors provides an…

Algebraic Topology · Mathematics 2009-02-25 Benoit Fresse

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…

Quantum Algebra · Mathematics 2025-08-01 Lukas Müller , Lukas Woike

The type-theoretic modelling of DRT that [degroote06] proposed features continuations for the management of the context in which a clause has to be interpreted. This approach, while keeping the standard definitions of quantifier scope,…

Computation and Language · Computer Science 2008-12-18 Sylvain Pogodalla