Statistical estimation of deducibility in polyadic algebras
Strong completeness of the Lambek Calculus with respect to Relational Semantics
In [vB88], Johan van Benthem introduces Relational Semantics (RelSem for short), and states Soundness Theorem for Lambek Calculus (LC) w.r.t. RelSem. After doing this, he writes: "it would be very interesting to have the converse too", i.e., to have Completeness Theorem. The same question is in [vB91, p. 235]. In the following, we state Strong Completeness Theorems for different versions of LC.
Substitution algebras in their relation to cylindric algebras.