Hartry Field's 'Metalogic and Modality'
Reading Hartry Field's paper 'Metalogic and Modality' (Philosophical Studies 62: 1-22, (1991)), I came over some comments reminding me of an argument against a proof-theoretic account of logical consequence that has always bothered me. In fact, I first read it in Etchemendy's The Concept of Logical Consequence, but I recall seeing it elsewhere as well. And now - in Field's article. But first, here is the Etchemendy quote:
Central notions in proof-theoretic semantics, such as proof-condition, harmony, normalizability, cut-elimination, recursiveness, etc., are all applicable to a wide range of systems, just as the rival notions, model, truth-in-a-model, truth-condition, satisfaction, etc. To take an example, Prawitz's definition of logical consequence in terms of the former notions fare no worse than Tarski's model-theoretic definition in terms of langauge-dependence. Another issue althogether is that the model-theoretic definition is more frequently applied, and thus has a wider range of actual appliactions. This, however, does not reflect on the potential.
If you're interested in the details of Prawitz's definition, here are some of his papers on the topic:
It has long been acknowledged that the purely syntactic approach does not yield a general analysis of the ordinary notion of consequence, and in principle cannot. The reason for this is simple. It is obvious, for starters, that the intuitive notion of consequence cannot be captured by any single deductive system. For one thing, such a system will be tied to a specific set of rules and a specific language, while the ordinary notion is not so restricted. Thus, by “consequence” we clearly do not mean derivability in this or that deductive system. But neither do we mean derivability in some deductive system or other, for any sentence is derivable from any other in some such system. So at best we might mean by “consequence” derivability in some sound deductive system. But the notion of soundness brings us straight back to the intuitive notion of consequence. (Etchemendy [1990, p. 2-3])Similarly, Hartry Field provides the following line of thoughts:
These model-theoretic definitions [Tarskian] are much more natural than proof-theoretic definitions of implication and consistency - for instance, a proof-theoretic definition proceeds in terms of some definite proof procedure, but it seems prette arbitrary which proof procedure one picks, and it isn't very satisfying to rest ones definitions of fundamental metalogical concepts on such highly arbitrary choices. (p. 2)In my master thesis, I argued that although this type of criticism - that a proof-theoretic account turns on a specific proof-system, and thus a specific language - applies to some out-of-date approaches, in particular, Hilbert's attempt at giving an axiomatic definition of logical consequence (whether or not Hilbert actually thought of himself is not all that relevant; Tarski certainly read something like this into the axiomatic project), the criticism is not applicable to semantic accounts framed in proof-theory, i.e., proof-theoretic semantics. The problem here is that many authors appear to be associating proof-theory merely with syntax, refusing it any semantic capacities. However, the tradition allowing 'proof' as a semantic notion (e.g., Prawitz, Dummett, Schröder-Heister, Wansing, Sundholm, Restall) typically appreciates proof-theory as something more than simply a collection of particular systems/languages.
Central notions in proof-theoretic semantics, such as proof-condition, harmony, normalizability, cut-elimination, recursiveness, etc., are all applicable to a wide range of systems, just as the rival notions, model, truth-in-a-model, truth-condition, satisfaction, etc. To take an example, Prawitz's definition of logical consequence in terms of the former notions fare no worse than Tarski's model-theoretic definition in terms of langauge-dependence. Another issue althogether is that the model-theoretic definition is more frequently applied, and thus has a wider range of actual appliactions. This, however, does not reflect on the potential.
If you're interested in the details of Prawitz's definition, here are some of his papers on the topic:
- "Ideas and results in proof theory", in: Proceedings of the 2. Scandinavian Logic Symposium, pp 237-309, J. Fenstad (ed), North-Holland, 1971.
- "On the idea of a general proof theory", Synthese 27, 1974, pp 63-77.
- "Remarks on some approaches to the concept of logical consequence", Synthese 62, 1985, pp 153-71.
- "Meaning approached via proofs", Synthese 148:507–524, 2006.

4 comments:
It is easy to set up a deductive system that is not tied to any particular language. But it is essential that there be an effective method for grouping terms according to their grammatical category. E.g., there must be some definite notion of 'noun' ('term') or 'verb' ('predicate') or 'quantifier', etc. The model-theoretic approach avoids this dependence, in some sense.
Maybe some people think that the "logical symbols" (e.g. connectives) must be singled out in advance, even for model theory. It is difficult to say what that means (specifically the 'logical symbols' part). Is identity, quantifiers (if not, what about in the generalized sense?), partially ordered truth functions, any old variable-binding operation?
But you're right. They make it sound as if there is no remotely general notion of 'deductive system'.
LPC,
"it is essential that there be an effective method for grouping terms according to their grammatical category. [...] The model-theoretic approach avoids this dependence, in some sense."
I'm not sure in which sense the model-theoretic definition can avoid such a dependency. Surely, in n>0-logics, a distinction between different grammatical categories are needed to make the satisfaction-clauses work. Of course, a proof-theoretic account will require much the same in expressing the rules. Did I misunderstand you somehow?
Well, for starters, notice that in the case of a deductive system, the method needs to be *effective* in the sense of e.g. Church. There may be no effective method for reading the signature off a structure.
In a (effective) deductive system, if a sentence is deducible from a set T, then it is deducible from a finite subset T' of T. This needn't be the case for model-theoretic consequence, e.g. in the case of L-structures in which L is a non-compact language.
It is easy to define a class C of L-structures that captures properties or relations that cannot be captured by any deductive system in the same language. E.g., if L is first-order, then identity is not captured in an effective deductive system based on L. (The usual axioms for identity do not suffice.) In other words, there are L-structures A containing properties/relations that are not L-definable.
Deductive systems are just more intimately tied to the language/syntax.
These are very interesting points. I do of course recognize differences over the model-theory/proof-theory distinction such as effectiveness, compactness, and definability, but these are restrictions on the concept of formal proof which I don't think detracts from the potential of giving proof-theoretic accounts of logical consequence. In other words, these features (or lack thereof) does not make the model-theoretic approach "much more natural" [Field], nor do they warrant the conclusion that the proof-theoretic approach "does not yield a general analysis of the *ordinary* notion of consequence" [Etchemendy, my emphasis].
That being said, I do think you're right in concluding that proof-theory is more intimately connected with language/syntax. But is this the same it being more language-dependent than model-theory?
Post a Comment