Persons
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
 
Kanovich, Max
Website: https://www.hse.ru/staff/mkanovich

https://www.mathnet.ru/eng/person72223
https://scholar.google.com/citations?user=K9TSah4AAAAJ&hl=en
https://mathscinet.ams.org/mathscinet/MRAuthorID/189039
ISTINA https://istina.msu.ru/workers/17898631
https://orcid.org/0000-0002-7502-1653
https://www.webofscience.com/wos/author/record/M-6531-2015
https://www.scopus.com/authid/detail.url?authorId=56117921300

Publications in Math-Net.Ru Citations
2023
1. Eben Blaisdell, Max Kanovich, Stepan L. Kuznetsov, Elaine Pimentel, Andre Scedrov, “Explorations in subexponential non-associative non-commutative linear logic”, Electron. Proc. Theor. Comput. Sci., 381 (2023),  4–19  mathnet  mathscinet
2022
2. Max Kanovich, Stepan Kuznetsov, Andre Scedrov, “Language models for some extensions of the Lambek calculus”, Inform. and Comput., 287 (2022),  104760–16  mathnet  scopus 3
3. Eben Blaisdell, Max Kanovich, Stepan L. Kuznetsov, Elaine Pimentel, Andre Scedrov, “Non-associative, Non-commutative Multi-modal Linear Logic”, Lecture Notes in Comput. Sci., 13385 (2022),  449–467  mathnet  mathscinet 2
4. Max. I. Kanovich, Stepan G. Kuznetsov, Stepan L. Kuznetsov, Andre Scedrov, “Decidable fragments of calculi used in CatLog”, Stud. Comput. Intell., 999 (2022),  1–24  mathnet 1
2021
5. Max Kanovich, Stepan Kuznetsov, Andre Scedrov, “The multiplicative-additive Lambek calculus with subexponential and bracket modalities”, J. Logic Lang. Inf., 30 (2021),  31–88  mathnet  mathscinet  isi  scopus 5
2020
6. Max Kanovich, Stepan Kuznetsov, Andre Scedrov, “Reconciling Lambek's restriction, cut-elimination, and substitution in the presence of exponential modalities”, J. Logic Comput., 30:1 (2020),  239–256  mathnet  mathscinet  isi  scopus 6
7. Max Kanovich, Stepan Kuznetsov, Vivek Nigam, Andre Scedrov, “Soft subexponentials and multiplexing”, Lecture Notes in Comput. Sci., 12166 (2020),  500–517  mathnet  scopus 5
2019
8. Max Kanovich, Stepan Kuznetsov, Andre Scedrov, “Undecidability of a Newly Proposed Calculus for CatLog3”, Lecture Notes in Comput. Sci., 11668 (2019),  67–83  mathnet  mathscinet  scopus 1
9. Max Kanovich, Stepan Kuznetsov, Andre Scedrov, “L-models and R-models for Lambek calculus enriched with additives and the multiplicative unit”, Lecture Notes in Comput. Sci., 11541 (2019),  373–391  mathnet  mathscinet  scopus 4
10. Max Kanovich, Stepan Kuznetsov, Andre Scedrov, “The complexity of multiplicative-additive Lambek calculus: 25 years later”, Lecture Notes in Comput. Sci., 11541 (2019),  356–372  mathnet  mathscinet  scopus 7
11. Max Kanovich, Stepan Kuznetsov, Vivek Nigam, Andre Scedrov, “Subexponentials in non-commutative linear logic”, Math. Structures Comput. Sci., 29:8 (2019),  1217–1249  mathnet  mathscinet  isi  scopus 24
2018
12. Glyn Morrill, Stepan Kuznetsov, Max Kanovich, Andre Scedrov, “Bracket induction for the Lambek calculus with bracket modalities”, Lecture Notes in Comput. Sci., 10950 (2018),  84–101  mathnet  mathscinet  scopus 5
13. Max Kanovich, Stepan Kuznetsov, Vivek Nigam, Andre Scedrov, “A logical framework with commutative and non-commutative subexponentials”, Lecture Notes in Comput. Sci., 10900 (2018),  228–245  mathnet  mathscinet  isi  scopus 9
2017
14. Max Kanovich, Stepan Kuznetsov, Glyn Morrill, Andre Scedrov, “A polynomial-time algorithm for the Lambek calculus with brackets of bounded order”, Leibniz Internat. Proc. in Inform., 84:22 (2017),  1–17  mathnet  mathscinet  scopus
15. Max Kanovich, Stepan Kuznetsov, Andre Scedrov, “Undecidability of the Lambek calculus with subexponential and bracket modalities”, Lecture Notes in Comput. Sci., 10472 (2017),  326–340  mathnet  mathscinet  isi  scopus 9
2016
16. Max Kanovich, Stepan Kuznetsov, Andre Scedrov, “Undecidability of the Lambek calculus with a relevant modality”, Lecture Notes in Comput. Sci., 9804 (2016),  240–256  mathnet  mathscinet  zmath  elib  scopus 13
17. M. Kanovich, S. Kuznetsov, A. Scedrov, “On Lambek's restriction in the presence of exponential modalities”, Lecture Notes in Comput. Sci., 9537 (2016),  146–158  mathnet  mathscinet  zmath  isi  elib  scopus 3
1989
18. M. I. Kanovich, “Semantics and logic of computational problems”, Dokl. Akad. Nauk SSSR, 305:4 (1989),  778–782  mathnet  mathscinet  zmath; Dokl. Math., 39:2 (1989), 334–338
1988
19. M. I. Kanovich, “Constructibility of the logic of computational problems”, Dokl. Akad. Nauk SSSR, 302:3 (1988),  530–535  mathnet  mathscinet  zmath; Dokl. Math., 38:2 (1989), 296–300
1987
20. M. I. Kanovitch, “A general method for constructing concrete strongly independent propositions”, Dokl. Akad. Nauk SSSR, 296:5 (1987),  1046–1050  mathnet  mathscinet  zmath; Dokl. Math., 36:2 (1988), 348–352
1986
21. M. I. Kanovich, “Quasipolynomial algorithms for the recognition of the satisfiability and derivability of propositional formulas”, Dokl. Akad. Nauk SSSR, 290:2 (1986),  281–286  mathnet  mathscinet  zmath
1985
22. M. I. Kanovitch, “Efficient logical algorithms for analysis and synthesis of dependencies”, Dokl. Akad. Nauk SSSR, 285:6 (1985),  1301–1305  mathnet  mathscinet  zmath
1984
23. M. I. Kanovich, “Solution of the problem of Rogers on the relationship between the strong and weak recursion theorems”, Dokl. Akad. Nauk SSSR, 279:5 (1984),  1040–1044  mathnet  mathscinet  zmath
24. M. I. Kanovich, “On the independence of invariant propositions”, Dokl. Akad. Nauk SSSR, 276:1 (1984),  27–31  mathnet  mathscinet  zmath
1983
25. M. I. Kanovich, “Reducibility via general recursive operators”, Dokl. Akad. Nauk SSSR, 273:4 (1983),  793–796  mathnet  mathscinet  zmath
26. M. I. Kanovich, “Complexity and convergence of algorithmic mass problems”, Dokl. Akad. Nauk SSSR, 272:2 (1983),  289–293  mathnet  mathscinet  zmath
27. M. I. Kanovitch, “On the implicativity of the lattice of truth-table degrees of algorithmic problems”, Dokl. Akad. Nauk SSSR, 270:5 (1983),  1046–1050  mathnet  mathscinet  zmath
28. M. I. Kanovich, “The register complexity of address machines”, Dokl. Akad. Nauk SSSR, 268:5 (1983),  1050–1054  mathnet  mathscinet  zmath
1982
29. M. I. Kanovitch, “On the complexity of the problem of separating recursively enumerable sets”, Dokl. Akad. Nauk SSSR, 267:6 (1982),  1300–1304  mathnet  mathscinet  zmath
30. M. I. Kanovitch, “On truth-table reducibilities of problems of extending partial recursive functions”, Dokl. Akad. Nauk SSSR, 264:2 (1982),  294–298  mathnet  mathscinet  zmath
1978
31. M. I. Kanovich, “An estimate of the complexity of arithmetic incompleteness”, Dokl. Akad. Nauk SSSR, 238:6 (1978),  1283–1286  mathnet  mathscinet  zmath
1977
32. M. I. Kanovitch, “Complex properties of context-sensitive languages”, Dokl. Akad. Nauk SSSR, 233:3 (1977),  289–292  mathnet  mathscinet  zmath
33. M. I. Kanovich, “On the precision of a complexity criterion for nonrecursiveness and universality”, Dokl. Akad. Nauk SSSR, 232:6 (1977),  1249–1252  mathnet  mathscinet  zmath
34. M. I. Kanovich, “Complexity of complete systems of equivalent transformations in programming languages”, Dokl. Akad. Nauk SSSR, 232:2 (1977),  273–276  mathnet  mathscinet  zmath
1975
35. M. I. Kanovitch, “Dekker's construction and effective nonrecursiveness”, Dokl. Akad. Nauk SSSR, 222:5 (1975),  1028–1030  mathnet  mathscinet  zmath
36. M. I. Kanovitch, “A hierarchical semantic system with set variables”, Dokl. Akad. Nauk SSSR, 221:6 (1975),  1256–1259  mathnet  mathscinet  zmath
1974
37. M. I. Kanovitch, ““Complex” and “simple” numbers”, Dokl. Akad. Nauk SSSR, 218:2 (1974),  276–277  mathnet  mathscinet  zmath
38. M. I. Kanovitch, “Complexity of the limit of Specker sequences”, Dokl. Akad. Nauk SSSR, 214:5 (1974),  1020–1023  mathnet  mathscinet  zmath
1973
39. M. I. Kanovitch, “Irreducibility of the languages of a step-by-step semantic system”, Dokl. Akad. Nauk SSSR, 212:4 (1973),  800–803  mathnet  mathscinet  zmath
40. M. I. Kanovitch, “On the complexity of approximation of arithmetic sets”, Dokl. Akad. Nauk SSSR, 211:5 (1973),  1038–1041  mathnet  mathscinet  zmath
1972
41. M. I. Kanovitch, “On the universality of strongly undecidable sets”, Dokl. Akad. Nauk SSSR, 204:3 (1972),  533–535  mathnet  mathscinet  zmath
42. M. I. Kanovitch, “Complexity of bounded decidability of semirecursively enumerable sets”, Dokl. Akad. Nauk SSSR, 203:6 (1972),  1246–1248  mathnet  mathscinet  zmath
1971
43. M. I. Kanovitch, “On domains of definition of optimal algorithms”, Dokl. Akad. Nauk SSSR, 198:2 (1971),  283–285  mathnet  mathscinet  zmath
44. M. I. Kanovitch, “On complexity of Boolean function minimization”, Dokl. Akad. Nauk SSSR, 198:1 (1971),  35–38  mathnet  mathscinet  zmath
1970
45. M. I. Kanovich, “Complexity of the decidability of an enumerable set as a criterion of its universality”, Dokl. Akad. Nauk SSSR, 194:3 (1970),  500–503  mathnet  mathscinet  zmath
46. M. I. Kanovitch, “The complexity of the solution of recursively enumerable sets”, Dokl. Akad. Nauk SSSR, 192:4 (1970),  721–723  mathnet  mathscinet  zmath
47. M. I. Kanovich, “The complexity of the enumeration and solvability of predicates”, Dokl. Akad. Nauk SSSR, 190:1 (1970),  23–26  mathnet  mathscinet  zmath 1
1969
48. M. I. Kanovich, “The complexity of the reduction of algorithms”, Dokl. Akad. Nauk SSSR, 186:5 (1969),  1008–1009  mathnet  mathscinet  zmath 1
49. M. I. Kanovitch, N. V. Petri, “Certain theorems on the complexity of normal algorithms and computations”, Dokl. Akad. Nauk SSSR, 184:6 (1969),  1275–1276  mathnet  mathscinet  zmath 1
50. M. I. Kanovitch, B. A. Kushner, “On an estimation of the complexity of some algorithmic problems of analysis”, Zap. Nauchn. Sem. LOMI, 16 (1969),  81–90  mathnet  mathscinet  zmath
51. M. I. Kanovitch, “On estimations of the complexity of bounded halting problem”, Zap. Nauchn. Sem. LOMI, 16 (1969),  77–80  mathnet  mathscinet  zmath

Presentations in Math-Net.Ru
1. Resource reasoning in program analysis
Max Kanovich
Colloquium of the Faculty of Computer Science
December 25, 2014 16:40   
2. How and Why Separation Logic is good for Resource Reasoning about Programs
Max Kanovich
International workshop "Logical Models of Reasoning and Computation"
February 2, 2012 10:45   

Organisations