( en | de | ru )

 

Disambiguation of "Kanovich, Max I."

Author of the publication

copydeleteadd this publication to your clipboard
Undecidability of the Lambek calculus with subexponentials and bracket modalities.

, , and . CoRR, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Nata i i

Daniel Anton Maxien

Tobias Maxisch

Michael Maxisch

Eva Max

 

Other publications of authors with the same name

Collaborative Planning with Confidentiality., , and . J. Autom. Reason., 46 (3-4): 389-421 (2011)Inductive methods and contract-signing protocols., , and . ACM Conference on Computer and Communications Security, page 176-185. ACM, (2001)Computational and Concurrency Aspects of Linear Logic.. IFIP Congress (1), volume A-51 of IFIP Transactions, page 336-341. North-Holland, (1994)On the Complexity of Pointer Arithmetic in Separation Logic (an extended version)., and . CoRR, (2018)Undecidability of Propositional Separation Logic and Its Neighbours., and . J. ACM, 61 (2): 14:1-14:43 (2014)Bounded Memory Protocols and Progressing Collaborative Systems., , , and . ESORICS, volume 8134 of Lecture Notes in Computer Science, page 309-326. Springer, (2013)Undecidability of the Lambek calculus with subexponentials and bracket modalities., , and . CoRR, (2016)Explorations in Subexponential non-associative non-commutative Linear Logic (extended version)., , , , and . CoRR, (2023)Bounded Memory Dolev-Yao Adversaries in Collaborative Systems., , , and . Formal Aspects in Security and Trust, volume 6561 of Lecture Notes in Computer Science, page 18-33. Springer, (2010)Phase semantics for light linear logic., , and . Theor. Comput. Sci., 294 (3): 525-549 (2003)