Compositionalty is the view that the meaning of a sentence is completely determined by the meaning of its parts i.e. for every connective that might be used to build up a sentence, there's a composition function which takes the meanings of whatever components the connective is being applied to, to the meaning of the overall thing you get after applying the connective.

Proof theoretic semantics is the idea that: a) understanding a sentence consists in an ability to recognize (canonical) proofs of that sentence, and b) the meaning of a sentence is "the property of being a proof of that sentence".

Odd as I feel defending Dummett, on any subject, I think Pagin is wrong to say these two things are incompatible.

What compositionality (as stated in e.g. the stanford encylopedia, and "informally" by Pagin himself) requires is that, for each connective phi, there be a function Cphi which takes the < property of being a proof of p, the property of being a proof of q, the property of being a proof of r > to <the property of being a proof of phi(p, q, r))<. But if you accept compositionality at all, this has to be the case, because the property of being a proof of phi(x) can only be different from that of being a proof of phi(y) if x and y are different, and hence the property of being a proof of x is different from the property of being a proof of y. I don't think Pagin would deny this.

The problem is that Pagin seems to think compositionality + proof theoretic semantics requires something more. He writes:

"The combination of proof-theoretic semantics with the requirement of recognizability of proofs comes into conflict with compositionality. For assume that we have a semantic function phi for a language L. A generalized composition function {rho} for phi must then meet two conditions: (i) it must be possible to know the meaning of any complex expression in L by knowing {rho}, the modes of composition and the meaning of simple expressions; and (ii) the condition of being a canonical proof must, for every provable sentence A, be met by some proof that is recognizable by any speaker who understands A."

Note the switch here from the idea that compositionality says there must BE a function, to the claim that it must be possible to learn the meaning of words by KNOWING this function together with various other facts.

Firstly, the very idea of "knowing rho" (where rho is a function) makes me feel itchy and confused. I understand what it is to know *that something is the case* e.g. that a function f takes a certain value on a certain input. And I (kindof) understand what it is to know a person (e.g. I don't know Bill Gates, but I do know my advisor W.G.). But what's the equivalent of being on a first name basis with an abstract mathematical object? Does knowing a function mean being able to compute it? Being able to give a definite description that refers to it? Being able to give two distinct definitions definitions and knowing that they pick out the same function.

My best guess at what Pagin intends here, is that 'knowing rho' = knowing some proposition of the form:"

But now, note that Pagin's claim doesn't follow at all from the idea of compositionality - that the meaning of a composite sentence completely supervenes on the meanings of the pieces it is composed out of. The claim that a function with a certain property *exists* does not entail that it is possible to *know* such a function exists, or that this function is computable, or that it is possible to know which program computes it! So, compositionality doesn't imply that its even possible to have such knowledge, much less that it's possible to use this knowledge to learn the meaning of various composite expressions.

This distinction is especially crucial to remember in the context of discussing Godel's Thereom. For, remember from the Putnam-Penrose debate that all our reasoning about mathematics might well *be* recursively axiomatizable, it's just that we couldn't use mathematical reasoning to come to *know* what this recursive axiomatization was.

And, alas, Godel is exactly where Pagin is headed. For, his argument turns out to be that, if you could know some concrete specification of the composition function rho, you could mill out a recursive specification of the class C of acceptable proofs in number theory, then you could use this to construct an acceptable proof of the con sentence for C, which is itself a statement in number theory, but (by Godel I) cannot be proved in C. Contradiction.

Pagin's conclusion is that compositionality and proof-theoretic semantics are incomptatible. But, if this argument works, all it really shows is proof-theoretic semantics requires that one could not come to *know* a recursive specification of the composition function phi.

At this point, Pagin might say that the whole point of compositionality is to explain how we can know the meaning of complex sentences, by knowing their parts, so that accepting this point would be bad news for the proof-theoretic semanticist. But note that, we obviously don't understand composite sentences by explicitly breaking them don into parts. So the fact that we could never realize that something was a concrete specification of the composition function for our language, doesn't prevent compositionality from helping explain our linguistic abilities.

## No comments:

## Post a Comment