Results 111 to 120 of about 107,210 (140)

On Finite Models of the Lambek Calculus

Studia Logica, 2005
The main result of the paper is a proof of the finite model property for the Lambek calculus with additive conjunction. This is a modification of \textit{W. Buszkowski}'s results for product-free fragments of the calculus [Math. Log. Q. 48, No. 1, 63--72 (2002; Zbl 0992.03029)]. In the paper under review, restricted cone frames are introduced.
openaire   +1 more source

Language completeness of the Lambek calculus

Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science, 2002
Proves that the Lambek calculus (J. Lambek, American Math. Monthly, vol. 65, no. 3, pp. 154-170, 1958), which is essentially a subsystem of noncommutative linear logic, is complete with respect to L-models, i.e. free semigroup models. >
openaire   +2 more sources

Lambek Calculus for Transformational Grammar

Research on Language and Computation, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

The Lambek Calculus

1988
There is a noticeable revival of categorial grammar these days, as a vehicle for linguistic description. The systems used differ somewhat from the original calculus of Ajdukiewicz and Bar-Hillel, however. In particular, there is a component of rules for ‘type change’ of expressions, making for greater flexibility and elegance. One fundamental system of
openaire   +1 more source

Models for polymorphic Lambek Calculus

1997
An adaptation of string-semantic models to the Polymorphic Lambek Calculus is studied. We note that if quantifiers range over arbitrary sets of strings, the polymorphic calculus is incomplete. The semantics is refined so that quantifiers range over sets of strings that are the interpretation of categories, and we prove a completeness result.
openaire   +1 more source

Lambek Calculus in Natural Deduction

Journal of Logic and Computation, 2007
A formulation of Lambek calculus in natural deduction is given. New rules for Lambek's multiplicative, non-commutative conjunction are proposed, rules for Lambek's two implications are standard. Rules for Lambek's conjunction are variants of general elimination rules: a symmetric elimination rule and its specializations, left elimination rule and right
openaire   +2 more sources

Completeness Results for Lambek Syntactic Calculus

Mathematical Logic Quarterly, 1986
We prove strong completeness of the Lambek syntactic calculus (with product) with respect to an algebraic semantics consisting of residuated semigroups spread over arbitrary semigroups. If the latter are free semigroups, strong completeness fails, but it is an open problem whether weak completeness holds.
openaire   +3 more sources

Dyadic Modalities and Lambek Calculus

1993
The Lambek calculus is a logic on the one hand, and a grammar on the other. The system is studied in different disciplines, having their own interests. The logician studies relations with other systems, models in general, cut elimination etc. The linguist is interested in parsing properties, expressive power, and models that are useful for (natural ...
openaire   +3 more sources

Relational Semantics for the Lambek-Grishin Calculus

2010
We study ternary relational semantics for LG: a symmetric version of the Lambek calculus with interaction principles due to Grishin [10]. We obtain completeness on the basis of a Henkin-style weak filter construction.
Kurtonina, N., Moortgat, M.J.
openaire   +3 more sources

Classical Conservative Extensions of Lambek Calculus

Studia Logica, 2002
The paper concerns the Lambek Calculus (LC) and its extensions. The pure Lambek Calculus, which is LC without additive constants, is also distinguished. Two systems are considered: Noncommutative Multiplicative-Additive Linear Logic (NMALL), introduced by the author (in 1991), and Cyclic Multiplicative-Additive Linear Logic (CyMALL), introduced by ...
openaire   +1 more source