In the recent literature on proof-theoretic semantics, there is mention of a generality condition on defining rules. According to this condition, the schematic formulation of the defining rules must be maximally general, in the sense that no restrictions should be placed on the contexts of these rules. In particular, context variables must always be present in the schematic rules and they should range over arbitrary collections of formulae. I argue against imposing such a condition, by showing that it has undesirable (...) results and that it is ill-supported by the arguments brought in its favour. (shrink)

Since the appearance of Prior’s tonk, inferentialists tried to formulate conditions that a collection of inference rules for a logical constant has to satisfy in order to succeed in conferring an acceptable meaning to it. Dummett proposed a pair of conditions, dubbed ‘harmony’ and ‘stability’ that have been cashed out in terms of the existence of certain transformations on natural deduction derivations called reductions and expansions. A long standing open problem for this proposal is posed by quantum disjunction: although its (...) rules are intuitively unstable, they pass the test of existence of expansions. Although most authors view instabilities of this kind as too subtle to be detected by the requirement of existence of expansions, we first discuss a case showing that this requirement can indeed detect instabilities of this kind, and then show how the expansions for disjunction-like connectives have to be reformulated to rule out quantum disjunction. We show how the alternative pattern for expansions can be formulated for connectives and quantifiers whose rules satisfy a scheme originally developed by Prawitz and Schroeder-Heister. Finally we compare our proposal with a recent one due to Jacinto and Read. (shrink)

Harmony and conservative extension are two criteria proposed to discern between acceptable and unacceptable rules. Despite some interesting works in this field, the exact relation between them is still not clear. In this article, some standard counterexamples to the equivalence between them are summarized, and a recent formulation of the notion of stability is used to express a more refined conjecture about their relation. Then Prawitz's proposal of a counterexample based on the truth predicate to this refined conjecture is shown (...) to rest on dubious assumptions. As a consequence, two new counterexamples are proposed: one uses the extension of logic with a small amount of arithmetic, while the other uses the extension of a small fragment of arithmetic with a problematic operator defined by Peano. It is argued that both these new counterexamples work fine to reject the conjecture and that the last one works also as a rejection of harmony as a complete criterion of acceptability of rules. (shrink)