?
Cobordisms and Commutative Categorial Grammars
Journal of Cognitive Science. 2021. Vol. 22. No. 2. P. 68–91.
We propose a concrete surface representation of abstract categorial grammars in the category of word cobordisms or cowordisms
for short, which are certain bipartite graphs decorated withwords in a given alphabet, generalizing linear logic proof-nets.
We also introduce and study linear logic grammars, directly based on cobordisms and using classical multiplicative linear logic
as a typing system.
Осипов Д.В., Математический сборник 2026 Т. 217 № 9 С. 130–146
Изучаются законы взаимности, связанные с комплексными линейными расслоениями на расслоениях на ориентируемые окружности. В частности, доказывается следующий закон взаимности. Пусть B – комплексное многообразие и πi:Mi→B – расслоение на ориентируемые окружности, где индекс i пробегает конечное множество. Пусть Li и Ni – комплексные линейные расслоения на каждом многообразии Mi. Закон взаимности утверждает, что сумма всех элементов (πi)∗(c1(Li)∪c1(Ni)), где (πi)∗ – ...
Added: September 3, 2026
Borkina A., Russian Japanology Review 2026 Vol. 9 No. 1 P. 30–48
The article examines the novel by Japanese writer Qudan Rie Tokyo Sympathy Tower, which was awarded the prestigious Akutagawa Literary Prize in 2024. The award sparked a wide discussion due to the writer’s use of generative artificial intelligence in her work, which not only suggested some ideas, but also became the prototype for one of ...
Added: September 2, 2026
Bodrova A. S., Русская литература 2026 № 3 С. 64–75
The article discusses the previously ignored parallels between The Same Old Story by I. A. Goncharov and a fragment of V. F. Odoyevsky’s unfinished novel Year 4338. Letters from Petersburg published in Issue 1 of Moskovsky Nabliudatel magazine in 1825. A detailed analysis of plot, motif, imagery similes between the two texts is provided, the ...
Added: September 2, 2026
Basalaev A., Rarovskii A., Journal of Singularities 2026 Vol. 30 P. 61–80
Saito theory associates to an isolated singularity rich structure that plays an important role in mirror symmetry. In this note we construct Saito theory for A and D type Landau-Ginzburg orbifolds. Namely, for the pairs (f,G), where f defines an isolated singularity of A and D type and G is a group of symmetries of ...
Added: September 1, 2026
Rybakov M., Shkatov D., Journal of Logic and Computation 2026 Vol. 36 No. 6 Article exag026
We prove Pi-1-1-hardness, and thus lack of recursive axiomatizability, of constant-domain modal predicate logics defined by a class of Dedekind complete linear Kripke frames containing a frame with an infinitely increasing chain of worlds. The result holds even for the language with one unary predicate letter, one propositional letter, and two individual variables. ...
Added: September 1, 2026
Tsygunova M., Вестник Томского государственного университета 2026 № 525 С. 56–66
This article examines examples of metaphorical creativity in the works of contemporary American writer Chuck Palahniuk, particularly in the context of describing psychoemotional states. The study examines twenty-six works by Palahniuk (twenty-three short stories and three novels) and identifies examples of metaphorical creativity in the conceptualization of mental states. The analysis focuses on Palahniuk's unconventional ...
Added: August 31, 2026
Селянин Ф. И., Moscow Mathematical Journal 2026 Vol. 26 No. 2 P. 167–187
Minkowski mixed volume of n subpolytopes D1,…,Dn of a polytope P⊂Rn clearly does not exceed the normalized volume n!Vol(P). Equality holds if and only if the subpolytopes are interlaced, i.e., each proper face F⊊P intersects at least dim(F)+1 of the polytopes Di. Efficiently computing mixed volumes for more general collections of subpolytopes is crucial for estimating the complexity of numerically solving polynomial systems.
Motivated by relaxing the bound dim(F)+1 to dim(F), we ...
Added: August 31, 2026
Kazaryan M., Dunin-Barkowski P., Bychkov B. et al., International Mathematics Research Notices 2026 Vol. 14 Article rnag146
We prove a recent conjecture of the fourth named author with P. Norbury that states a system of universal polynomial relations among the kappa classes on the moduli spaces of algebraic curves. The proof involves localization and materialization analysis of the spin Gromov–Witten theory of the projective line and is dictated by Z 2 -equivariant ...
Added: August 31, 2026
Kazaryan M., Dunin-Barkowski P., Bychkov B. et al., Communications in Mathematical Physics 2026 Vol. 407 No. 69
We prove that for any initial data on a genus zero spectral curve the cor responding correlation differentials of topological recursion are KP integrable. As an application we prove KP integrability of partition functions associated via ELSV-type formulas to the r-th roots of the twisted powers of the log canonical bundles ...
Added: August 31, 2026
Chernov A., Философические письма. Русско-европейский диалог 2026 Т. 9 № 2 С. 217–230
This publication introduces a previously unpublished note by prominent conservative thinker and diplomat Alexandru Sturdza, "The Application of the Holy Alliance to the Current Situation," written in October 1820. The document emerged in the context of an acute crisis of the Vienna system caused by a wave of revolutionary uprisings in Southern Europe (Spain, Portugal, ...
Added: August 31, 2026
Gromov V., Переслегин С. Б., Переслегина Е. Б. et al., СПб.: Полакс, 2026.
Механизм происходящих в мире изменений носит эволюционный, а не экологический характер. Иначе говоря, Человечество столкнулось с кризисом развития, который имеет три независимые составляющие: кризис индустриального общества (фазовый кризис), кризис научного мышления (эпистемный кризис) и кризис формата существования разума (социосистемный кризис). Доклад посвящён аспектам этого триединого кризиса и возможным путям его преодоления, не сводящимся к первичному ...
Added: August 31, 2026
Devyatov R. A., Mathematical notes 2026 Vol. 119 No. 3 P. 782–786
Let G/B be a flag variety over ℂ, where G is a simple algebraic group with a simply laced Dynkin diagram, and B is a Borel subgroup. We say that the product of classes of Schubert divisors in the Chow ring is multiplicity free if it is possible to multiply it by a Schubert class ...
Added: August 30, 2026
Sergey Slavnov, Logical Methods in Computer Science 2023 Vol. 19 No. 4
It is known that different categorial grammars have surface representation in a fragment of first order multiplicative linear logic (MLL1). We show that the fragment of interest is equivalent to the recently introduced extended tensor type calculus (ETTC). ETTC is a calculus of specific typed terms, which represent tuples of strings, more precisely bipartite graphs ...
Added: December 20, 2023
Blaisdell E., Kanovich M., Stepan L. Kuznetsov et al., , in: Automated Reasoning: 11th International Joint Conference, IJCAR 2022, Haifa, Israel, August 8–10, 2022, ProceedingsVol. 13385.: Cham: Springer, 2022. P. 449–467.
Added: August 7, 2022
Kanovich M., Kuznetsov S., Scedrov A., Information and Computation 2022 Vol. 287 Article 104760
We investigate language interpretations of two extensions of the Lambek calculus: with additive conjunction and disjunction and with additive conjunction and the unit constant. For extensions with additive connectives, we show that conjunction and disjunction behave differently. Adding both of them leads to incompleteness due to the distributivity law. We show that with conjunction only ...
Added: December 4, 2021
Sergey Slavnov, Mathematical Structures in Computer Science 2021 Vol. 31 No. 5 P. 495–534
Ehrhard et al. (2018. Proceedings of the ACM on Programming Languages, POPL 2, Article 59.) proposed a model of probabilistic functional programming in a category of normed positive cones and stable measurable cone maps, which can be seen as a coordinate-free generalization of probabilistic coherence spaces (PCSs). However, unlike the case of PCSs, it remained unclear ...
Added: November 16, 2021
Slavnov S. A., Journal of Logic and Computation 2022 Vol. 32 No. 3 P. 479–517
We consider tensor grammars, which are an example of ‘commutative’ grammars, based on the classical (rather than intuitionistic) linear logic. They can be seen as a surface representation of abstract categorial grammars (ACG) in the sense that derivations of ACG translate to derivations of tensor grammars and this translation is isomorphic on the level of string ...
Added: October 21, 2021
Kanovich M., Kuznetsov S., Scedrov A., Journal of Logic, Language and Information 2021 Vol. 30 No. 1 P. 31–88
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 versions of Morrill’s calculi, and focus on their fragments including multiplicative (Lambek) connectives, additive conjunction and disjunction, brackets and bracket modalities, and the ! subexponential modality. For ...
Added: November 25, 2020
Kanovich M., Kuznetsov S., Nigam V. et al., , in: Automated Reasoning, 10th International Joint Conference, IJCAR 2020, Part IVol. 12166.: Cham: Springer, 2020. P. 500–517.
Added: July 1, 2020
Kanovich M., Kuznetsov S., Scedrov A., Journal of Logic and Computation 2020 Vol. 30 No. 1 P. 239–256
The Lambek calculus can be considered as a version of non-commutative intuitionistic linear logic. One of the interesting features of the Lambek calculus is the so-called ‘Lambek’s restriction’, i.e. the antecedent of any provable sequent should be non-empty. In this paper, we discuss ways of extending the Lambek calculus with the linear logic exponential modality ...
Added: July 1, 2020
Sergey Slavnov, Logical Methods in Computer Science 2019 Vol. 15 No. 3 P. 1–25
Pomset logic introduced by Retoré is an extension of linear logic with a self-dual noncommutative connective. The logic is defined by means of proof-nets, rather than a sequent calculus. Later a deep inference system BV was developed with an eye to capturing Pomset logic, but equivalence of system has not been proven up to now. ...
Added: October 23, 2019
Kanovich M., Kuznetsov S., Scedrov A., , in: Formal Grammar 2019, 24th International ConferenceVol. 11668.: Berlin: Springer, 2019. P. 67–83.
In his recent papers “Parsing/theorem-proving for logical grammar CatLog3” and “A note on movement in logical grammar”, Glyn Morrill proposes a new substructural calculus to be used as the basis for the categorial grammar parser CatLog3. In this paper we prove that the derivability problem for a fragment of this calculus is algorithmically undecidable. ...
Added: October 15, 2019
Sergey Slavnov, Mathematical Structures in Computer Science 2019 Vol. 29 No. 2 P. 215–242
We introduce a category of vector spaces modelling full propositional linear logic, similar to probabilistic coherence spaces and to Koethe sequences spaces. Its objects are rigged sequence spaces, Banach spaces of sequences, with norms defined from pairing with finite sequences, and morphisms are bounded linear maps, continuous in a suitable topology. The main interest of the ...
Added: December 24, 2017
Kanovich M., Kuznetsov S., Morrill G. et al., , in: Second International Conference on Formal Structures for Computation and Deduction, FSCD 2017Vol. 84: 2nd International Conference on Formal Structures for Computation and Deduction (FSCD 2017).: [б.и.], 2017. P. 22:1–22:17.
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 for determining provability of bounded depth formulas in L* , the Lambek calculus with empty antecedents allowed. Pentus’ algorithm is based on tabularisation of proof nets. Lambek calculus with ...
Added: September 15, 2017