On Constraint-Based Lambek Calculi
| dc.creator | Doerre, Jochen | |
| dc.creator | Manandhar, Suresh | |
| dc.date | 1995-08-15 | |
| dc.date.accessioned | 2026-07-07T09:09:59Z | |
| dc.date.available | 2026-07-07T09:09:59Z | |
| dc.description | We explore the consequences of layering a Lambek proof system over an arbitrary (constraint) logic. A simple model-theoretic semantics for our hybrid language is provided for which a particularly simple combination of Lambek's and the proof system of the base logic is complete. Furthermore the proof system for the underlying base logic can be assumed to be a black box. The essential reasoning needed to be performed by the black box is that of {\em entailment checking}. Assuming feature logic as the base logic entailment checking amounts to a {\em subsumption} test which is a well-known quasi-linear time decidable problem. | |
| dc.description | uuencoded gzipped ps file, 97k, 18 pages | |
| dc.identifier | https://arxiv.org/abs/cmp-lg/9508008 | |
| dc.identifier | http://arxiv.org/abs/cmp-lg/9508008 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/151229 | |
| dc.subject | Computation and Language | |
| dc.title | On Constraint-Based Lambek Calculi | |
| dc.type | text |