*Compositionality can solve Carnap's problem for natural languages (2015)*

(CogMaster's mini-stage)
Carnap has shown that one cannot retrieve the reference of logical terms from the patterns of inference they give rise to. Translated to natural languages, this means that functional elements (like *every*, *and*) cannot be acquired solely on the basis of entailments between sentences. Bonnay proved that Carnap's problem vanishes if we take compositionality to be a semantic universal (with some other minor assumptions). In this paper, I show that this result extends to the kind of trivalent first-order logic that is suited to deal with presuppositions.