Unique typed basic categorial grammars
Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 2 (2022), pp. 64-67
Cet article a éte moissonné depuis la source Math-Net.Ru
It is proved that unique typed basic categorial grammars are not closed under any natural language operations.
@article{VMUMM_2022_2_a9,
author = {M. E. Vishnikin},
title = {Unique typed basic categorial grammars},
journal = {Vestnik Moskovskogo universiteta. Matematika, mehanika},
pages = {64--67},
year = {2022},
number = {2},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/VMUMM_2022_2_a9/}
}
M. E. Vishnikin. Unique typed basic categorial grammars. Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 2 (2022), pp. 64-67. http://geodesic.mathdoc.fr/item/VMUMM_2022_2_a9/
[1] Ajdukiewicz K., “Die syntaktische Konnexität”, Stud. Philos., 1 (1935), 1–27
[2] Bar-Hillel Y., Gaifman C., Shamir E., “On categorical and phrase-structure grammars”, Bull. Res. Council Israel, 9F (1960), 155–166 | MR | Zbl
[3] Lambek J., “The mathematics of sentence structure”, Amer. Math. Monthly, 65:3 (1958), 154–170 | DOI | MR | Zbl
[4] Pentus M.R., “Ischislenie Lambeka i formalnye grammatiki”, Fund. i prikl. matem., 1:3 (1995), 729–751 | MR | Zbl
[5] Safiullin A.N., “Vyvodimost dopustimykh pravil s prostymi posylkami v ischislenii Lambeka”, Vestn. Mosk. un-ta. Matem. Mekhan., 2007, no. 4, 72–76 | MR | Zbl
[6] Pentus A.E., Pentus M.R., Teoriya formalnykh yazykov, Ucheb. posobie, Izd-vo TsPI pri mekh.-mat. f-te MGU, M., 2004