Add to ORKGIt is well known that the Lambek Grammars are weakly equivalent to the Context-Free Grammars (CFGs, Pentus 1993, 1997), and that testing string membership with a CFG is in P (Earley 1970). Nevertheless, Pentus (2003) has recently proven that sequent derivability in the Lambek Calculus with product is NP-complete. The complexity of the corresponding problem for the product-free fragment remains unknown
The satisfiability problem is known to be NP-complete in general and for many restricted instances, ...
Abstract. The standard reasoning problem, concept satisfiability, in the basic description logic ALC...
Abstract. We consider bounded versions of undecidable problems about context-free languages which re...
It is well known that the Lambek Grammars are weakly equivalent to the Context-Free Grammars (CFGs, ...
this paper, when we mention the Lambek Calculus (LC) or Lambek Grammars (LG), we are referring to th...
AbstractIn this paper, we prove that the derivability problems for product-free Lambek calculus and ...
In this paper we prove that the derivability problems for product-free Lambek calculus and product-f...
Lambek calculus is a logical foundation of categorial grammar, a linguistic paradigm of grammar as l...
Lambek calculus is a logical foundation of categorial grammar, a linguistic paradigm of grammar as l...
Summary. Fifth of a series of articles laying down the bases for classical first order model theory....
A revised version will appear in a volume in honour of Lambek 90th birthdayInternational audienceIn ...
Residuated lattices form one of the theoretical backbones of the Lambek Calculus as the standard fre...
We study Nonassociative Lambek Calculus with additives ∧,∨, sat-isfying the distributive law (Full N...
The problem of whether Lambek Calculus is complete with respect to (w.r.t.) relational semantics, ha...
In this paper the Chomsky Conjecture is proved: all languages recognized by the Lambek calculus are ...
The satisfiability problem is known to be NP-complete in general and for many restricted instances, ...
Abstract. The standard reasoning problem, concept satisfiability, in the basic description logic ALC...
Abstract. We consider bounded versions of undecidable problems about context-free languages which re...
It is well known that the Lambek Grammars are weakly equivalent to the Context-Free Grammars (CFGs, ...
this paper, when we mention the Lambek Calculus (LC) or Lambek Grammars (LG), we are referring to th...
AbstractIn this paper, we prove that the derivability problems for product-free Lambek calculus and ...
In this paper we prove that the derivability problems for product-free Lambek calculus and product-f...
Lambek calculus is a logical foundation of categorial grammar, a linguistic paradigm of grammar as l...
Lambek calculus is a logical foundation of categorial grammar, a linguistic paradigm of grammar as l...
Summary. Fifth of a series of articles laying down the bases for classical first order model theory....
A revised version will appear in a volume in honour of Lambek 90th birthdayInternational audienceIn ...
Residuated lattices form one of the theoretical backbones of the Lambek Calculus as the standard fre...
We study Nonassociative Lambek Calculus with additives ∧,∨, sat-isfying the distributive law (Full N...
The problem of whether Lambek Calculus is complete with respect to (w.r.t.) relational semantics, ha...
In this paper the Chomsky Conjecture is proved: all languages recognized by the Lambek calculus are ...
The satisfiability problem is known to be NP-complete in general and for many restricted instances, ...
Abstract. The standard reasoning problem, concept satisfiability, in the basic description logic ALC...
Abstract. We consider bounded versions of undecidable problems about context-free languages which re...