Results 91 to 100 of about 160,476 (167)
The hidden structural rules of the discontinuous Lambek calculus
Capítol de llibre d'homenatge "Categories and Types in Logic, Language, and Physics. Essays Dedicated to Jim Lambek on the Occasion of His 90th Birthday"The sequent calculus sL for the Lambek calculus L ([2]) has no structural rules. Interestingly, sL is
Valentín Fernández Gallart, José Oriol
core
The conjoinability relation in Lambek calculus and linear logic
, 1993 In 1958 J. Lambek introduced a calculus L of syntactic types and defined an equivalence relation on types: “x ≡ y means that there exists a sequence x = x1,..., xn = y (n ≥ 1), such that xi → xi+1 or xi+1 → xi (1 ≤ i < n)”.
Mati Pentus
core
Electronic Proceedings in Theoretical Computer Science, 2022 M. Sadrzadeh
semanticscholar +1 more source
LC Graphs for the Lambek Calculus with Product [PDF]
, 2010 This paper introduces a novel graph representation of proof nets for the Lambek calculus that extends the LC graph representation of [13] to include the product connective. This graph representation more clearly specifies the difference between the Lambek calculus with and without product than other proof net representations, which is important to the ...
openaire +1 more source
The derivability problem for Lambek calculus with one division
, 2006 In this paper we prove that the derivability problem for Lambek calculus with one division is decidable in polynomial time and present an algorithm for ...
Savateev, Y., Yury Savateev
core
A Bird's Eye View of Human Language Evolution. [PDF]
Front Evol Neurosci, 2012 Berwick RC +3 more
europepmc +1 more source
Visual Analysis of Research Paper Collections Using Normalized Relative Compression. [PDF]
Entropy (Basel), 2019 Vázquez PP.
europepmc +1 more source
A polynomial-time algorithm for the Lambek calculus with brackets of bounded order
Lambek calculus is a logical foundation of categorial grammar, a linguistic paradigm of grammar as logic and parsing as deduction. Pentus (2010) gave a polynomial-time algorithm for determining provability of bounded depth formulas in L*, the Lambek ...
Kuznetsov, Stepan +3 more
core
Comparing and evaluating extended Lambek calculi
, 2015 International audienceLambeks Syntactic Calculus, commonly referred to as the Lambek calculus, was innovative in many ways, notably as a precursor of linear logic. But it also showed that we could treat our grammatical framework as a logic (as opposed to
Moot, Richard
core