Accordingly, we now define a meaning as a tree such that, first, each node is occupied by an ordered pair (c of a category and an appropriate intension for that category; and second, immediately beneath any non terminal node occupied by such a pair (c are two or more nodes, and these are occupied by pairs (q, (/ „), (ct,),. .