English
Related papers

Related papers: Linear Hyperdoctrines and Comodules

200 papers

We define the notion of a model of higher-order modal logic in an arbitrary elementary topos $\mathcal{E}$. In contrast to the well-known interpretation of (non-modal) higher-order logic, the type of propositions is not interpreted by the…

Logic · Mathematics 2017-03-07 Steve Awodey , Kohei Kishida , Hans-Christoph Kotzsch

We study extensively the homotopy theory of coalgebras. By coalgebras, we mean the full theory of coalgebras: with counits and not necessarily locally conilpotent. For example $\mathcal E_\infty$-coalgebras, $\mathcal A_\infty$-coalgebras,…

Algebraic Topology · Mathematics 2022-03-11 Brice Le Grignou , Damien Lejay

A type theory is presented that combines (intuitionistic) linear types with type dependency, thus properly generalising both intuitionistic dependent type theory and full linear logic. A syntax and complete categorical semantics are…

Logic in Computer Science · Computer Science 2026-05-07 Matthijs Vákár

A type theory is presented that combines (intuitionistic) linear types with type dependency, thus properly generalising both intuitionistic dependent type theory and full linear logic. A syntax and complete categorical semantics are…

Logic in Computer Science · Computer Science 2026-05-07 Matthijs Vákár

Multisorted modules, equivalently representations of quivers, equivalently additive functors on preadditive categories, encompass a wide variety of additive structures. In addition, every module has a natural and useful multisorted…

Representation Theory · Mathematics 2018-08-01 Mike Prest

We classify the homogeneous finite-dimensional permutation structures, i.e., homogeneous structures in a language of finitely many linear orders, giving a nearly complete answer to a question of Cameron, and confirming the classification…

Logic · Mathematics 2020-02-26 Samuel Braunfeld , Pierre Simon

We construct a symmetric monoidal closed category of polynomial endofunctors (as objects) and simulation cells (as morphisms). This structure is defined using universal properties without reference to representing polynomial diagrams and is…

Logic in Computer Science · Computer Science 2015-07-01 Hyvernat Pierre

We introduce a logic for knowledge representation and reasoning on protein-protein interactions. Modulo a theory, formulas describe protein structures and dynamic changes. They can be composed in order to add or remove static and dynamic…

Logic in Computer Science · Computer Science 2019-09-19 Adrien Husson , Jean Krivine

We show that a wide class of $W$-(super)algebras, including $W_N^{(N-1)}$, $U(N)$-superconformal as well as $W_N$ nonlinear algebras, can be linearized by embedding them as subalgebras into some {\em linear} (super)conformal algebras with…

High Energy Physics - Theory · Physics 2009-10-28 S. Krivonos , A. Sorin

We give the definition of presentations of linear monoidal categories. Our main result is that given a presentation of a linear monoidal category, we can produce a presentation of the same category as a linear category. We apply this result…

Representation Theory · Mathematics 2018-10-26 Bingyan Liu

Koszul algebras have arisen in many contexts; algebraic geometry, combinatorics, Lie algebras, non-commutative geometry and topology. The aim of this paper and several sequel papers is to show that for any finite dimensional algebra there…

Category Theory · Mathematics 2014-12-17 Roberto Martinez-Villa , Øyvind Solberg

We explain the notion of colimit in category theory as a potential tool for describing structures and their communication, and the notion of higher dimensional algebra as a potential yoga for dealing with processes and processes of…

Category Theory · Mathematics 2008-02-10 R. Brown , T. Porter

This paper provides a geometric characterization of subclasses of the regular languages. We use finite model theory to characterize objects like strings and trees as relational structures. Logical statements meeting certain criteria over…

Formal Languages and Automata Theory · Computer Science 2019-08-23 Jonathan Rawski

This paper is a submission to the contest: How to combine logics? at the World Congress and School on Universal Logic III, 2010. We claim that combining "things", whatever these things are, is made easier if these things can be seen as the…

Logic in Computer Science · Computer Science 2009-11-19 Dominique Duval

We define an extension of predicate logic, called Binding Logic, where variables can be bound in terms and in propositions. We introduce a notion of model for this logic and prove a soundness and completeness theorem for it. This theorem is…

Logic in Computer Science · Computer Science 2023-05-26 Gilles Dowek , Thérèse Hardin , Claude Kirchner

Reasoning semantically in first-order logic is notoriously a challenge. This paper surveys a selection of semantically-guided or model-based methods that aim at meeting aspects of this challenge. For first-order logic we touch upon…

Artificial Intelligence · Computer Science 2019-11-22 Maria Paola Bonacina , Ulrich Furbach , Viorica Sofronie-Stokkermans

Positive logic is a generalisation of full first-order logic that does not have negation built in. Still, many model-theoretic ideas, tools and techniques work perfectly fine in positive logic. Importantly, there is a compactness theorem.…

Logic · Mathematics 2025-11-14 Mark Kamsma

We prove that the semantics of intuitionistic linear logic in vector spaces which uses cofree coalgebras is also a model of differential linear logic, and that the Cartesian closed category of cofree coalgebras is a model of the…

Logic in Computer Science · Computer Science 2020-06-24 James Clift , Daniel Murfet

There are several topological spaces associated to a complex hyperplane arrangement: the complement and its boundary manifold, as well as the Milnor fiber and its own boundary. All these spaces are related in various ways, primarily by a…

Algebraic Geometry · Mathematics 2014-10-14 Alexander I. Suciu

In this paper, we explore a connection between binary hierarchical models, their marginal polytopes and codeword polytopes, the convex hulls of linear codes. The class of linear codes that are realizable by hierarchical models is…

Statistics Theory · Mathematics 2016-04-08 Thomas Kahle , Walter Wenzel , Nihat Ay