Related papers: Semi-Substructural Logics with Additives
The category Set_* of sets and partial functions is well-known to be traced monoidal, meaning that a partial function S+U -/-> T+U can be coherently transformed into a partial function S -/-> T. This transformation is generally described in…
We present two embeddings of infinite-valued Lukasiewicz logic L into Meyer and Slaney's abelian logic A, the logic of lattice-ordered abelian groups. We give new analytic proof systems for A and use the embeddings to derive corresponding…
A contraction-free and cut-free sequent calculus $\msf{G3SDM}$ for semi-De Morgan algebras, and a structural-rule-free and single-succedent sequent calculus $\msf{G3DM}$ for De Morgan algebras are developed. The cut rule is admissible in…
In categorical realizability, it is common to construct categories of assemblies and categories of modest sets from applicative structures. These categories have structures corresponding to the structures of applicative structures. In the…
A logic calculus is presented that is a conservative extension of linear logic. The motivation beneath this work concerns lazy evaluation, true concurrency and interferences in proof search. The calculus includes two new connectives to deal…
The Caus[-] construction takes a compact closed category of basic processes and yields a *-autonomous category of higher-order processes obeying certain signalling/causality constraints, as dictated by the type system in the resulting…
The logic of definitions is a family of logics for encoding and reasoning about judgments, which are atomic predicates specified by inference rules. A definition associates an atomic predicate with a logical formula, which may itself depend…
Monadic second order logic is the expansion of first order logic by quantifiers ranging over unary relations. We study the shared monadic second order theory of finite linear orders, i.e. the pseudofinite monadic second order theory of…
Traditional approaches to modelling parallelism and algebraic structure in lambda calculi often rely on monads$\unicode{x2013}$as in Moggi's framework$\unicode{x2013}$or on rich categorical structures such as biproducts$\unicode{x2013}$as…
In many real-life settings, agents must navigate dynamic environments while reasoning under incomplete information and acting on a corpus of unstable, context-dependent, and often conflicting norms. We introduce a general, non-modal,…
Designing complex engineered systems requires managing tightly coupled trade-offs between subsystem capabilities and resource requirements. Monotone co-design provides a compositional language for such problems, but its generality does not…
We propose a categorial grammar based on classical multiplicative linear logic. This can be seen as an extension of abstract categorial grammars (ACG) and is at least as expressive. However, constituents of {\it linear logic grammars (LLG)}…
In some optimal control problems, complex relationships between states and inputs cannot be easily represented using continuous constraints, necessitating the use of discrete logic instead. This paper presents a method for incorporating…
This note is about the smash product of pointed topological spaces, without relying on some convenient subcategory. We deal with its partial associativity properties and their connection with the function spaces, introducing a property of…
The existence of adjoints to algebraic functors between categories of models of Lawvere theories follows from finite-product-preservingness surviving left Kan extension. A result along these lines was proved in Appendix 2 of Brian Day's…
We introduce notions of lax semiadditive and lax additive $(\infty,2)$-categories, categorifying the classical notions of semiadditive and additive 1-categories. To establish a well-behaved axiomatic framework, we develop a calculus of lax…
In this paper, we introduce a new class of derivations that generalizes skew derivations and semi-derivations, and we call it ``skew semi-derivation". Further, we present a study of the conditions under which this type of multiplicative…
Separation logics are a family of extensions of Hoare logic for reasoning about programs that mutate memory. These logics are "abstract" because they are independent of any particular concrete memory model. Their assertion languages, called…
It is well known that the category of Gray-categories does not admit a monoidal biclosed structure that models weak higher-dimensional transformations. In this paper, the first of a series on the topic, we describe several skew monoidal…
We introduce a tensor product for symmetric monoidal categories with the following properties. Let SMC denote the 2-category with objects small symmetric monoidal categories, arrows symmetric monoidal functors and 2-cells monoidal natural…