Related papers: Regular and relational categories: Revisiting 'Car…
Orthogonality is a notion based on the duality between programs and their environments used to determine when they can be safely combined. For instance, it is a powerful tool to establish termination properties in classical formal systems.…
This paper improves two existing theorems of interest to neo-logicist philosophers of mathematics. The first is a classification theorem due to Fine for equivalence relations between concepts definable in a well-behaved second-order logic.…
We develop further the theory of monoidal bicategories by introducing and studying bicategorical counterparts of the notions of a linear exponential comonad, as considered in the study of linear logic, and of a codereliction transformation,…
Separation Logic is a widely used formalism for describing dynamically allocated linked data structures, such as lists, trees, etc. The decidability status of various fragments of the logic constitutes a long standing open problem. Current…
The primary goal of this paper is to abstract notions, results and constructions from the theory of categories to the broader setting of plots. Loosely speaking, a plot can be thought of as a non-associative non-unital category with a…
The concept of a clone is central to many branches of mathematics, such as universal algebra, algebraic logic, and lambda calculus. Abstractly a clone is a category with two objects such that one is a countably infinite power of the other.…
This paper is divided into two parts. The first is a review, through categorical lenses, of the classical theory of regular-singular differential systems over $C((x))$ and $\mathbb P^1_C\smallsetminus\{0,\infty\}$, where $C$ is…
We define the concept of a regular object with respect to another object in an arbitrary category. We present basic properties of regular objects and we study this concept in the special cases of abelian categories and locally finitely…
The primary goal of this paper is to recast the semantics of modal logic, and dynamic epistemic logic (DEL) in particular, in category-theoretic terms. We first review the category of relations and categories of Kripke frames, with…
Local-order-invariant (first-order) logic is an extension of first-order logic where formulae have access to a ternary local order relation on the Gaifman graph, provided that the truth value does not depend on the specific order relation…
We introduce a complete many-valued semantics for basic normal lattice-based modal logic. This relational semantics is grounded on many-valued formal contexts from Formal Concept Analysis. We discuss an interpretation and possible…
In this work we explore the connections between (linear) nested sequent calculi and ordinary sequent calculi for normal and non-normal modal logics. By proposing local versions to ordinary sequent rules we obtain linear nested sequent…
We define bicategories internal to 2-categories. When the ambient 2-category is symmetric monoidal categories, this provides a convenient framework for encoding the structures of a symmetric monoidal 3-category. This framework is well…
There is a growing need for abstractions in logic specification languages such as FO(.) and ASP. One technique to achieve these abstractions are templates (sometimes called macros). While the semantics of templates are virtually always…
Binary relations are one of the standard ways to encode, characterise and reason about graphs. Relation algebras provide equational axioms for a large fragment of the calculus of binary relations. Although relations are standard tools in…
The usual modelling of the syllogisms of the Organon by a calculus of classes does not include relations. Aristotle may however have envisioned them in the first two books as the category of relatives, where he allowed them to compose with…
In a bicategory of spans (an example of a 'generic bicategory') the factorization of a span (s,t) as the span (s,1) followed by (1,t) satisfies a simple universal property with respect to all factorizations in terms of the generic…
The theory of regular cost functions is a quantitative extension to the classical notion of regularity. A cost function associates to each input a non-negative integer value (or infinity), as opposed to languages which only associate to…
Justification logics are special kinds of modal logics which provide a framework for reasoning about epistemic justifications. For this, they extend classical boolean propositional logic by a family of necessity-style modal operators "t:",…
Bicategories of spans are characterized as cartesian bicategories in which every comonad has an Eilenberg-Moore ob ject and every left adjoint arrow is comonadic.