RUS
ENG
Full version
JOURNALS
// Lecture Notes in Computer Science
// Archive
Lecture Notes in Comput. Sci., 2019, Volume 11541,
Pages
356–372
(Mi lncs35)
This article is cited in
7
papers
The complexity of multiplicative-additive Lambek calculus: 25 years later
Max Kanovich
ab
,
Stepan Kuznetsov
cb
,
Andre Scedrov
db
a
University College London, London, UK
b
National Research University Higher School of Economics, Moscow, Russia
c
Steklov Mathematical Institute of the RAS, Moscow, Russia
d
University of Pennsylvania, Philadelphia, USA
Language:
English
DOI:
10.1007/978-3-662-59533-6_22
Cited by
Bibliographic databases:
©
Steklov Math. Inst. of RAS
, 2024