3 citations · 4 across the 4 of their papers we have counts for
Showing 2017 · cs.LOShow all
3 papers · 2 filters
cs.LO2017★ 3 cited
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…
cs.LO2017
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…
cs.LO2017
Time, Computational Complexity, and Probability in the Analysis of Distance-Bounding Protocols
Max Kanovich, Tajana Ban Kirigin, Vivek Nigam +2
Many security protocols rely on the assumptions on the physical properties in which its protocol sessions will be carried out. For instance, Distance Bounding Protocols take into a…