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 …

Pomset logic introduced by Retor\'e is an extension of linear logic with a self-dual
noncommutative connective. The logic is defined by means of proof-nets, rather than a …

In categorical realizability, it is common to construct categories of assemblies and modest
sets from applicative structures. In this paper, we introduce several classes of applicative …

In this paper we introduce Commutative/Non-Commutative Logic (CNC logic) and two
categorical models for CNC logic. This work abstracts Benton's Linear/Non-Linear Logic by …

We consider relational semantics (R-models) for the Lambek calculus extended with
intersection and explicit constants for zero and unit. For its variant without constants and a …

One gap in the literature on functional programming and software verification is the
application of non-commutative logic. This gap is easily seen by the lack of programming …

In this paper, we consider the polymodal version of Lambek calculus with subexponential
modalities initially introduced by Kanovich, Kuznetsov, Nigam, and Scedrov and its quantale …

In the tradition of “parsing as deduction', various logical calculi have been considered for
applications in formal linguistics. A lively strand of research focuses on the analysis of …

In the tradition of 'parsing as deduction', various logical calculi have been considered for
applications in formal linguistics. A lively strand of research focuses on the analysis of …

In the tradition of 'parsing as deduction', various logical calculi have been considered for
applications in formal linguistics. In recent years a line of research has emerged focusing on …