Related papers: A categorical semantic for the Typed Epsilon Calcu…
The manuscript at hand systematically studies K\"unneth formulas at a categorical level. We give criteria for an abstract six functor formalism to satisfy the categorical K\"unneth formula, and use this to formulate conjectures for…
The semantics as to which set of arguments in a given argumentation graph may be acceptable (acceptability semantics) can be characterised in a few different ways. Among them, labelling-based approach allows for concise and flexible…
BV-categories are a recent development that aims to give categorical semantics to proofs in the logic BV. However, due to the absence of a coherence theorem on one side and a well-defined notion of proof identity for BV on the other side,…
There is a well-known correspondence between coherent theories (and their interpretations) and coherent categories (resp. functors), hence the (2,1)-category $\mathbf{Coh_{\sim}}$ (of small coherent categories, coherent functors and all…
In a previous work, we proved that almost all of the Calculus of Inductive Constructions (CIC), which is the basis of the proof assistant Coq, can be seen as a Calculus of Algebraic Constructions (CAC), an extension of the Calculus of…
The paper describes a parser for Categorial Grammar which provides fully word by word incremental interpretation. The parser does not require fragments of sentences to form constituents, and thereby avoids problems of spurious ambiguity.…
Building on previous work, we study the splitting of idempotents in the category of extensions $\mathbb{E}\operatorname{-Ext}(\mathcal{C})$ associated to a pair $(\mathcal{C},\mathbb{E})$ of an additive category and a biadditive functor to…
We prove a symbolic calculus for a class of pseudodifferential operators, and discuss its applications to $L^2$-compactness via a compact version of the $T(1)$ theorem.
Under categorial grammars that have powerful rules like composition, a simple n-word sentence can have exponentially many parses. Generating all parses is inefficient and obscures whatever true semantic ambiguities are in the input. This…
Presentations of categories are a well-known algebraic tool to provide descriptions of categories by means of generators, for objects and morphisms, and relations on morphisms. We generalize here this notion, in order to consider situations…
Following Eilenberg-Steenrod axiomatic approach we construct the universal ordinary homology theory for any homological structure on a given category by representing ordinary theories with values in abelian categories. For a convenient…
The present paper gives a generalization of cartesian closed categories, called cartesian closed categories with dependence, whose strict version induces categories with families that support 1-, Sigma- and Pi-types in the strict sense.…
We construct a model category (in the sense of Quillen) for set theory, starting from two arbitrary, but natural, conventions. It is the simplest category satisfying our conventions and modelling the notions of finiteness, countability and…
We introduce fibred type-theoretic fibration categories which are fibred categories between categorical models of Martin-L\"{o}f type theory. Fibred type-theoretic fibration categories give a categorical description of logical predicates…
We propose an intersection type system for an imperative lambda-calculus based on a state monad and equipped with algebraic operations to read and write to the store. The system is derived by solving a suitable domain equation in the…
Algebraic theories with dependency between sorts form the structural core of Martin-L\"of type theory and similar systems. Their denotational semantics are typically studied using categorical techniques; many different categorical…
The notion of a complete type can be generalized in a natural manner to allow assigning a value in an arbitrary Boolean algebra B to each formula. We show some basic results regarding the effect of the properties of B on the behavior of…
We show that any closed model category of simplicial algebras over an algebraic theory is Quillen equivalent to a proper closed model category. By ``simplicial algebra'' we mean any category of algebras over a simplicial algebraic theory,…
We discuss the problem of defining a logic for analogical reasoning, and sketch a solution in the style of the semantics for Counterfactual Conditionals, Preferential Structures, etc.
We give a leisurely introduction to our abstract framework for operational semantics based on cellular monads on transition categories. Furthermore, we relate it for the first time to an existing format, by showing that all Positive GSOS…