Vishnikin, M. E. Unique typed basic categorial grammars. (English. Russian original) Zbl 07584507 Mosc. Univ. Math. Bull. 77, No. 2, 93-96 (2022); translation from Vestn. Mosk. Univ., Ser. I 77, No. 2, 64-67 (2022). Summary: It is proved that unique typed basic categorial grammars are not closed under any natural language operations. MSC: 03Bxx General logic 68Qxx Theory of computing 03Dxx Computability and recursion theory Keywords:unique typed basic categorial grammars; Chomsky hierarchy; context-free languages × Cite Format Result Cite Review PDF Full Text: DOI References: [1] Ajdukiewicz, K., Die syntaktische Konnexität, Stud. Philos., 1, 1-27 (1935) · Zbl 0015.33702 [2] Bar-Hillel, Y.; Gaifman, C.; Shamir, E., On categorical and phrase-structure grammars, Bull. Res. Council Israel., 9F, 155-166 (1960) · Zbl 0158.25306 [3] Lambek, J., The mathematics of sentence structure, Am. Math. Mon., 65, 154-170 (1958) · Zbl 0080.00702 · doi:10.1080/00029890.1958.11989160 [4] Pentus, M. R., Lambek calculus and formal grammars, Fundam. Prikl. Mat., 1, 729-751 (1995) · Zbl 0865.03028 [5] Safiullin, A. N., Derivability of admissible rules with simple premises in the Lambek calculus, Moscow Univ. Math. Bull., 62, 168-171 (2007) · Zbl 1164.03003 · doi:10.3103/S0027132207040092 [6] A. E. Pentus and M. R. Pentus, Theory of Formal Languages: Textbook (Izd-vo TsPI pri Mekh.-Mat. Fakul’tete Mosk. Gos. Univ., Moscow, 2004). This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.