3 citations · 4 across the 4 of their papers we have counts for
6 papers · 1 filter
Explorations in Subexponential Non-associative Non-commutative Linear Logic
Eben Blaisdell, Max Kanovich, Stepan L. Kuznetsov +2
In a previous work we introduced a non-associative non-commutative logic extended by multimodalities, called subexponentials, licensing local application of structural rules. Here,…
Explorations in Subexponential non-associative non-commutative Linear Logic (extended version)
Eben Blaisdell, Max I. Kanovich, Stepan L. Kuznetsov +2
In a previous work we introduced a non-associative non-commutative logic extended by multimodalities, called subexponentials, licensing local application of structural rules. Here,…
The Multiplicative-Additive Lambek Calculus with Subexponential and Bracket Modalities
Max Kanovich, Stepan Kuznetsov, Andre Scedrov
We give a proof-theoretic and algorithmic complexity analysis for systems introduced by Morrill to serve as the core of the CatLog categorial grammar parser. We consider two recent…
On the Complexity of Pointer Arithmetic in Separation Logic (an extended version)
James Brotherston, Max Kanovich
We investigate the complexity consequences of adding pointer arithmetic to separation logic. Specifically, we study extensions of the points-to fragment of symbolic-heap separation…
Simulating Linear Logic in 1-Only Linear Logic
Max Kanovich
Linear Logic was introduced by Girard as a resource-sensitive refinement of classical logic. It turned out that full propositional Linear Logic is undecidable (Lincoln, Mitchell, S…
A polynomial time algorithm for the Lambek calculus with brackets of bounded order
Max Kanovich, Stepan Kuznetsov, Glyn Morrill +1
Lambek calculus is a logical foundation of categorial grammar, a linguistic paradigm of grammar as logic and parsing as deduction. Pentus (2010) gave a polynomial-time algorithm fo…