Zobrazeno 1 - 10
of 38
pro vyhledávání: '"Stepan L. Kuznetsov"'
Autor:
Stepan L. Kuznetsov
Publikováno v:
Logical Methods in Computer Science, Vol Volume 19, Issue 4 (2023)
We consider relational semantics (R-models) for the Lambek calculus extended with intersection and explicit constants for zero and unit. For its variant without constants and a restriction which disallows empty antecedents, Andreka and Mikulas (1994)
Externí odkaz:
https://doaj.org/article/f03010db146e4c55bda65b89a83ea680
Publikováno v:
Studia Logica. 111:251-280
Autor:
Stepan L. Kuznetsov
Publikováno v:
Logic and Algorithms in Computational Linguistics 2021 (LACompLing2021) ISBN: 9783031217791
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7f7438d5ab11147fa74424854da7f995
https://doi.org/10.1007/978-3-031-21780-7_1
https://doi.org/10.1007/978-3-031-21780-7_1
Autor:
Stepan L. Kuznetsov
Publikováno v:
ACM Transactions on Computational Logic. 22:1-26
Action logic is the algebraic logic (inequational theory) of residuated Kleene lattices. One of the operations of this logic is the Kleene star, which is axiomatized by an induction scheme. For a stronger system that uses an -rule instead (infinitary
Publikováno v:
Journal of Logic, Language and Information. 30: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 includi
Publikováno v:
Journal of Logic and Computation. 30: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 shoul
Publikováno v:
Automated Reasoning ISBN: 9783031107689
Adding multi-modalities (called subexponentials) to linear logic enhances its power as a logical framework, which has been extensively used in the specification of e.g. proof systems, programming languages and bigraphs. Initially, subexponentials all
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c048724e034eb053cb677681fa888aa5
https://doi.org/10.1007/978-3-031-10769-6_27
https://doi.org/10.1007/978-3-031-10769-6_27
Publikováno v:
Studies in Computational Intelligence ISBN: 9783030901370
Studies in Computational Intelligence
Studies in Computational Intelligence
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ef986af83b745049eb9a77ed79d38609
https://doi.org/10.1007/978-3-030-90138-7_1
https://doi.org/10.1007/978-3-030-90138-7_1
Autor:
Stepan L. Kuznetsov
Publikováno v:
Relational and Algebraic Methods in Computer Science ISBN: 9783030887001
RAMiCS
RAMiCS
We consider the Lambek calculus extended with intersection (meet) operation. For its variant which does not allow empty antecedents, Andreka and Mikulas (1994) prove strong completeness w.r.t. relational models (R-models). Without the antecedent non-
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::af9b0f5610e47a21bd41bf587c6c6fb8
https://doi.org/10.1007/978-3-030-88701-8_16
https://doi.org/10.1007/978-3-030-88701-8_16
Autor:
Stepan L. Kuznetsov
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030860585
TABLEAUX
TABLEAUX
Infinitary action logic (\(\mathbf {ACT}_\omega \)) can be viewed as an extension of the multiplicative-additive Lambek calculus (\(\mathbf {MALC}\)) with iteration (Kleene star) governed by an omega-rule (Buszkowski, Palka 2007). An alternative form
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5104ad156d1e5c7a35cc3d08b2dca6f5
https://doi.org/10.1007/978-3-030-86059-2_19
https://doi.org/10.1007/978-3-030-86059-2_19