 As discussed in  section 1.2,  Fodor elucidates constituency structure in terms of part/whole relations. A complex representation’s constituents are literal parts of it. One consequence is that, whenever the first representation is tokened, so are its constituents. Fodor takes this consequence to be definitive of classical computation. As Fodor and McLaughlin (1990: 186) put it: 