In discussing propositional quantifiers we have considered two kinds of variables: variables occupying the argument places of connectives, and variables occupying the argument places of predicates.We began with languages which contained the first kind of variable, i.e., variables taking sentences as substituends. Our first point was that there appear to be no sentences in English that serve as adequate readings of formulas containing propositional quantifiers. Then we showed how a certain natural and illuminating extension of English by prosentences did provide (...) perspicuous readings. The point of introducing prosentences was to provide a way of making clear the grammar of propositional variables: propositional variables have a prosentential character — not a pronominal character. Given this information we were able to show, on the assumption that the grammar of propositional variables in philosopher's English should be determined by their grammar in formal languages (unless a separate account of their grammar is provided), that propositional variables can be used in a grammatically and philosophically acceptable way in philosophers' English. According to our criteria of well-formedness Carnap's semantic definition of truth does not lack an ‘essential’ predicate - despite arguments to the contrary. It also followed from our account of the prosentential character of bound propositional variables that in explaining propositional quantification, sentences should not be construed as names.One matter we have not discussed is whether such quantification should be called ‘propositional’, ‘sentential’, or something else. As our variables do not range over (they are not terms) either propositions, or sentences, each name is inappropriate, given the usual picture of quantification. But we think the relevant question in this context is, are we obtaining generality with respect to propositions, sentences, or something else?Because people have argued that all bound variables must have a pronominal character, we presented and discussed in the third section languages in which the variables take propositional terms as substituends. In our case we included names of propositions, that-clauses, and names of sentences in the set of propositional terms. We made a few comparisons with the languages discussed in the second section. We showed among other things how a truth predicate could be used to obtain generality. In contrast, the languages of the second section, using propositional variables, obtain generality without the use of a truth predicate. (shrink)

I here argue for a particular formulation of truth-deflationism, namely, the propositionally quantified formula, (Q) “For all p, <p> is true iff p”. The main argument consists of an enumeration of the other (five) possible formulations and criticisms thereof. Notably, Horwich’s Minimal Theory is found objectionable in that it cannot be accepted by finite beings. Other formulations err in not providing non-questionbegging, sufficiently direct derivations of the T-schema instances. I end by defending (Q) against various objections. In particular, I argue (...) that certain circularity charges rest on mistaken assumptions about logic that lead to Carroll’s regress. I show how the propositional quantifier can be seen as on a par with first-order quantifiers and so equally acceptable to use. While the proposed parallelism between these quantifiers is controversial in general, deflationists have special reasons to affirm it. I further argue that the main three types of approach the truth-paradoxes are open to an adherent of (Q), and that the derivation of general facts about truth can be explained on its basis. (shrink)