Certain phenomena resist coverage within the Lambek Calculus, such as scope-ambiguity and non-peripheral extraction. I have argued in previous work that an extension called Polymorphic Lambek Calculus (PLC), which adds variables and their universal quantification, covers these phenomena. However, a major problem is the absence of a known decision procedure for PLC grammars. This paper proposes a decision procedure which covers a subset of all the possible PLC grammars, a subset which, however, includes the PLC grammars with wide coverage. The decision procedure is shown to be terminating, and correct, and a Prolog implementation of it is described.
[1]
M. Moortgat.
Categorial Investigations: Logical and Linguistic Aspects of the Lambek Calculus
,
1988
.
[2]
Daniel Mey,et al.
Investigations on a calculus without contractions
,
1992
.
[3]
D. Gabbay.
Semantical investigations in Heyting's intuitionistic logic
,
1981
.
[4]
J. Lambek.
The Mathematics of Sentence Structure
,
1958
.
[5]
John C. Reynolds,et al.
Towards a theory of type structure
,
1974,
Symposium on Programming.
[6]
J. Y. Girard,et al.
Interpretation fonctionelle et elimination des coupures dans l'aritmetique d'ordre superieur
,
1972
.