## Thursday, February 2, 2017

### Characterizing quantifiers by rules of inference

One standard characterization of quantifiers is that they are bits of speech that follow certain rules of inference (e.g., universal instantiation, existential generalization, etc.). This characterization is surely incorrect.

Let p be any complicated logical truth. Consider the symbols ∃* and ∀* such that ∃*xF and ∀*xF are abbreviations for p ∧ ∃xF and p ∧ ∀xF. Then ∃* and ∀* satisfy exactly the same rules of inference as ∃ and ∀, but they are not quantifiers. The sentence ∃*Fx expresses a conjunctive proposition rather than a quantified one.

In other words, the characterization of quantifiers by logical rules misses the hyperintensionality at issue. The same is true of the characterization of any other logical connectives by logical rules.

#### 1 comment:

Brandon said...

The sentence ∃*Fx is translatable as a conjunctive proposition, but (for instance) in the same way "All S is P" is translatable as an implicative proposition in some logical systems; it's unclear to me why such translations have any relevance to the question of whether ∃* or All are operating as quantifiers in the propositions in which they actually occur.