27 citations · 73 across the 13 of their papers we have counts for
5 papers · 1 filter
Undecidability of the Lambek calculus with subexponential and bracket modalities
Max Kanovich, Stepan Kuznetsov, Andre Scedrov
The Lambek calculus is a well-known logical formalism for modelling natural language syntax. The original calculus covered a substantial number of intricate natural language phenom…
Reconciling Lambek's restriction, cut-elimination, and substitution in the presence of exponential modalities
Max Kanovich, Stepan Kuznetsov, Andre Scedrov
The Lambek calculus can be considered as a version of non-commutative intuitionistic linear logic. One of the interesting features of the Lambek calculus is the so-called "Lambek's…
Biabduction (and Related Problems) in Array Separation Logic
James Brotherston, Nikos Gorogiannis, Max Kanovich
We investigate array separation logic (ASL), a variant of symbolic-heap separation logic in which the data structures are either pointers or arrays, i.e., contiguous blocks of allo…
Timed Multiset Rewriting and the Verification of Time-Sensitive Distributed Systems
Max Kanovich, Tajana Ban Kirigin, Vivek Nigam +2
Time-Sensitive Distributed Systems (TSDS), such as applications using autonomous drones, achieve goals under possible environment interference (\eg, winds). Moreover, goals are oft…
Undecidability of the Lambek calculus with a relevant modality
Max Kanovich, Stepan Kuznetsov, Andre Scedrov
Morrill and Valentin in the paper "Computational coverage of TLG: Nonlinearity" considered an extension of the Lambek calculus enriched by a so-called "exponential" modality. This…