, Volume 6, Issue 1, pp 53-77
Date: 21 Feb 2008

Is Adjunction Compositional?

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


This paper shows that there is no compositional TAG for boolean expressions. This indicates that adjunction cannot carry the weight of constructing the semantics compositionally, in contrast to approaches based on discontinuity instead (like Linear Context Free Rewrite Systems). Although the proof is based on the assumption that the semantic functions are partial it seems highly unlikely that allowing partial semantic functions will help.

I am indebted to several reviewers for the journal for their criticism and also to Ben George for many conversations about the topic of TAGs and compositionality. Remaining errors are my own responsibility.