research
∙
08/08/2023
Explorations in Subexponential Non-associative Non-commutative Linear Logic
In a previous work we introduced a non-associative non-commutative logic...
share
research
∙
05/07/2021
On the Complexity of Verification of Time-Sensitive Distributed Systems: Technical Report
This paper develops a Multiset Rewriting language with explicit time for...
research
∙
07/31/2020
The Multiplicative-Additive Lambek Calculus with Subexponential and Bracket Modalities
We give a proof-theoretic and algorithmic complexity analysis for system...
research
∙
07/31/2020
Language Models for Some Extensions of the Lambek Calculus
We investigate language interpretations of two extensions of the Lambek ...
research
∙
11/12/2018
Compliance in Real Time Multiset Rewriting Models
The notion of compliance in Multiset Rewriting Models (MSR) has been int...
research
∙
03/08/2018
On the Complexity of Pointer Arithmetic in Separation Logic (an extended version)
We investigate the complexity consequences of adding pointer arithmetic ...
research
∙
09/09/2017
Simulating Linear Logic in 1-Only Linear Logic
Linear Logic was introduced by Girard as a resource-sensitive refinement...
research
∙
05/01/2017
A polynomial time algorithm for the Lambek calculus with brackets of bounded order
Lambek calculus is a logical foundation of categorial grammar, a linguis...
research
∙
08/13/2016
Undecidability of the Lambek calculus with subexponential and bracket modalities
The Lambek calculus is a well-known logical formalism for modelling natu...
research
∙
08/07/2016
Reconciling Lambek's restriction, cut-elimination, and substitution in the presence of exponential modalities
The Lambek calculus can be considered as a version of non-commutative in...
research
∙
01/23/2016
