RUS  ENG
Full version
PEOPLE

Kanovich Max

Publications in Math-Net.Ru

  1. Explorations in subexponential non-associative non-commutative linear logic

    Electron. Proc. Theor. Comput. Sci., 381 (2023),  4–19
  2. Language models for some extensions of the Lambek calculus

    Inform. and Comput., 287 (2022),  104760–16
  3. Non-associative, Non-commutative Multi-modal Linear Logic

    Lecture Notes in Comput. Sci., 13385 (2022),  449–467
  4. Decidable fragments of calculi used in CatLog

    Stud. Comput. Intell., 999 (2022),  1–24
  5. The multiplicative-additive Lambek calculus with subexponential and bracket modalities

    J. Logic Lang. Inf., 30 (2021),  31–88
  6. Reconciling Lambek's restriction, cut-elimination, and substitution in the presence of exponential modalities

    J. Logic Comput., 30:1 (2020),  239–256
  7. Soft subexponentials and multiplexing

    Lecture Notes in Comput. Sci., 12166 (2020),  500–517
  8. Undecidability of a Newly Proposed Calculus for CatLog3

    Lecture Notes in Comput. Sci., 11668 (2019),  67–83
  9. L-models and R-models for Lambek calculus enriched with additives and the multiplicative unit

    Lecture Notes in Comput. Sci., 11541 (2019),  373–391
  10. The complexity of multiplicative-additive Lambek calculus: 25 years later

    Lecture Notes in Comput. Sci., 11541 (2019),  356–372
  11. Subexponentials in non-commutative linear logic

    Math. Structures Comput. Sci., 29:8 (2019),  1217–1249
  12. Bracket induction for the Lambek calculus with bracket modalities

    Lecture Notes in Comput. Sci., 10950 (2018),  84–101
  13. A logical framework with commutative and non-commutative subexponentials

    Lecture Notes in Comput. Sci., 10900 (2018),  228–245
  14. A polynomial-time algorithm for the Lambek calculus with brackets of bounded order

    Leibniz Internat. Proc. in Inform., 84:22 (2017),  1–17
  15. Undecidability of the Lambek calculus with subexponential and bracket modalities

    Lecture Notes in Comput. Sci., 10472 (2017),  326–340
  16. Undecidability of the Lambek calculus with a relevant modality

    Lecture Notes in Comput. Sci., 9804 (2016),  240–256
  17. On Lambek's restriction in the presence of exponential modalities

    Lecture Notes in Comput. Sci., 9537 (2016),  146–158
  18. Semantics and logic of computational problems

    Dokl. Akad. Nauk SSSR, 305:4 (1989),  778–782
  19. Constructibility of the logic of computational problems

    Dokl. Akad. Nauk SSSR, 302:3 (1988),  530–535
  20. A general method for constructing concrete strongly independent propositions

    Dokl. Akad. Nauk SSSR, 296:5 (1987),  1046–1050
  21. Quasipolynomial algorithms for the recognition of the satisfiability and derivability of propositional formulas

    Dokl. Akad. Nauk SSSR, 290:2 (1986),  281–286
  22. Efficient logical algorithms for analysis and synthesis of dependencies

    Dokl. Akad. Nauk SSSR, 285:6 (1985),  1301–1305
  23. 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
  24. On the independence of invariant propositions

    Dokl. Akad. Nauk SSSR, 276:1 (1984),  27–31
  25. Reducibility via general recursive operators

    Dokl. Akad. Nauk SSSR, 273:4 (1983),  793–796
  26. Complexity and convergence of algorithmic mass problems

    Dokl. Akad. Nauk SSSR, 272:2 (1983),  289–293
  27. On the implicativity of the lattice of truth-table degrees of algorithmic problems

    Dokl. Akad. Nauk SSSR, 270:5 (1983),  1046–1050
  28. The register complexity of address machines

    Dokl. Akad. Nauk SSSR, 268:5 (1983),  1050–1054
  29. On the complexity of the problem of separating recursively enumerable sets

    Dokl. Akad. Nauk SSSR, 267:6 (1982),  1300–1304
  30. On truth-table reducibilities of problems of extending partial recursive functions

    Dokl. Akad. Nauk SSSR, 264:2 (1982),  294–298
  31. An estimate of the complexity of arithmetic incompleteness

    Dokl. Akad. Nauk SSSR, 238:6 (1978),  1283–1286
  32. Complex properties of context-sensitive languages

    Dokl. Akad. Nauk SSSR, 233:3 (1977),  289–292
  33. On the precision of a complexity criterion for nonrecursiveness and universality

    Dokl. Akad. Nauk SSSR, 232:6 (1977),  1249–1252
  34. Complexity of complete systems of equivalent transformations in programming languages

    Dokl. Akad. Nauk SSSR, 232:2 (1977),  273–276
  35. Dekker's construction and effective nonrecursiveness

    Dokl. Akad. Nauk SSSR, 222:5 (1975),  1028–1030
  36. A hierarchical semantic system with set variables

    Dokl. Akad. Nauk SSSR, 221:6 (1975),  1256–1259
  37. “Complex” and “simple” numbers

    Dokl. Akad. Nauk SSSR, 218:2 (1974),  276–277
  38. Complexity of the limit of Specker sequences

    Dokl. Akad. Nauk SSSR, 214:5 (1974),  1020–1023
  39. Irreducibility of the languages of a step-by-step semantic system

    Dokl. Akad. Nauk SSSR, 212:4 (1973),  800–803
  40. On the complexity of approximation of arithmetic sets

    Dokl. Akad. Nauk SSSR, 211:5 (1973),  1038–1041
  41. On the universality of strongly undecidable sets

    Dokl. Akad. Nauk SSSR, 204:3 (1972),  533–535
  42. Complexity of bounded decidability of semirecursively enumerable sets

    Dokl. Akad. Nauk SSSR, 203:6 (1972),  1246–1248
  43. On domains of definition of optimal algorithms

    Dokl. Akad. Nauk SSSR, 198:2 (1971),  283–285
  44. On complexity of Boolean function minimization

    Dokl. Akad. Nauk SSSR, 198:1 (1971),  35–38
  45. Complexity of the decidability of an enumerable set as a criterion of its universality

    Dokl. Akad. Nauk SSSR, 194:3 (1970),  500–503
  46. The complexity of the solution of recursively enumerable sets

    Dokl. Akad. Nauk SSSR, 192:4 (1970),  721–723
  47. The complexity of the enumeration and solvability of predicates

    Dokl. Akad. Nauk SSSR, 190:1 (1970),  23–26
  48. The complexity of the reduction of algorithms

    Dokl. Akad. Nauk SSSR, 186:5 (1969),  1008–1009
  49. Certain theorems on the complexity of normal algorithms and computations

    Dokl. Akad. Nauk SSSR, 184:6 (1969),  1275–1276
  50. On an estimation of the complexity of some algorithmic problems of analysis

    Zap. Nauchn. Sem. LOMI, 16 (1969),  81–90
  51. On estimations of the complexity of bounded halting problem

    Zap. Nauchn. Sem. LOMI, 16 (1969),  77–80

© Steklov Math. Inst. of RAS, 2024