Results 111 to 120 of about 160,476 (167)

Bracket Induction for Lambek Calculus with Bracket Modalities [PDF]

Lecture Notes in Computer Science, 2018
Relativisation involves dependencies which, although unbounded, are constrained with respect to certain island domains. The Lambek calculus L can provide a very rudimentary account of relativisation limited to unbounded peripheral extraction; the Lambek ...
Glyn Morrill, Stepán Kuznetsov, Max Kanovich   +2 more
exaly   +3 more sources

Some of the next articles are maybe not open access.

Related searches:

Lambek Calculus with Conjugates

Studia Logica, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
I. Sedlár, A. Tedder
semanticscholar   +3 more sources

Lambek Calculus and its relational semantics: Completeness and incompleteness

Journal of Logic, Language and Information, 1994
The problem of whether Lambek Calculus is complete with respect to (w.r.t.) relational semantics, has been raised several times, cf. van Benthem (1989a) and van Benthem (1991). In this paper, we show that the answer is in the affirmative. More precisely,
Hajnal Andreka, Szabolcs Mikuláš, Andreka Hajnal   +2 more
exaly   +2 more sources

Lambek Calculus with Optional Divisions

ESSLLI Student Sessions, 2021
Tikhon Pshenitsyn
semanticscholar   +2 more sources

Foundations of LLCM: Labelled Lambek Calculus for Music Analysis

EvoMUSART
This paper presents an application of Lambek Calculus, a sequent calculus for categorial grammar, to music analysis. To this end, we propose a Labelled Lambek Calculus for Music (LLCM), where a label represents tonality information.
M. Bizzarri, Satoshi Tojo
semanticscholar   +2 more sources

On Classical Nonassociative Lambek Calculus

Lecture Notes in Computer Science, 2016
AbstractCNL, intoduced by de Groote and Lamarche [11], is a conservative extension of Nonassociative Lambek Calculus (NL) by a De Morgan negation $$^{\sim }$$ ∼ , satisfying $$A^{\sim }/B\Leftrightarrow A\backslash B^{\sim }$$
Wojciech Buszkowski, Buszkowski Wojciech   +1 more
exaly   +2 more sources

FULL LAMBEK CALCULUS WITH CONTRACTION IS UNDECIDABLE [PDF]

The Journal of Symbolic Logic, 2016
AbstractWe prove that the set of formulae provable in the full Lambek calculus with the structural rule of contraction is undecidable. In fact, we show that the positive fragment of this logic is undecidable.
Karel Chvalovský, Rostislav Horcík
semanticscholar   +4 more sources

On the Recognizing Power of the Lambek Calculus with Brackets [PDF]

Journal of Logic, Language and Information, 2018
minor ...
Makoto Kanazawa
exaly   +4 more sources

Intrinsic Verification of Parsers and Formal Grammar Theory in Dependent Lambek Calculus

Proc. ACM Program. Lang.
We present Dependent Lambek Calculus (LambekD), a domain-specific dependent type theory for verified parsing and formal grammar theory. In LambekD, linear types are used as a syntax for formal grammars, and parsers can be written as linear terms.
Steven Schaefer, Nathan Varner, P. H. Azevedo de Amorim, Max S. New   +3 more
semanticscholar   +1 more source

On embedding Lambek calculus into commutative categorial grammars

Journal of Logic and Computation, 2020
categorial grammars (ACG), as well as some other, closely related systems, are based on the ordinary, commutative implicational linear logic and linear $\lambda$-calculus in contrast to the better known "noncommutative" Lambek grammars and their ...
Sergey Slavnov
semanticscholar   +1 more source