Journal of Philosophical Logic

, Volume 29, Issue 2, pp 123–154 | Cite as

Harmony and Autonomy in Classical Logic

  • Stephen Read


Michael Dummett and Dag Prawitz have argued that a constructivist theory of meaning depends on explicating the meaning of logical constants in terms of the theory of valid inference, imposing a constraint of harmony on acceptable connectives. They argue further that classical logic, in particular, classical negation, breaks these constraints, so that classical negation, if a cogent notion at all, has a meaning going beyond what can be exhibited in its inferential use.

I argue that Dummett gives a mistaken elaboration of the notion of harmony, an idea stemming from a remark of Gerhard Gentzen"s. The introduction-rules are autonomous if they are taken fully to specify the meaning of the logical constants, and the rules are harmonious if the elimination-rule draws its conclusion from just the grounds stated in the introduction-rule. The key to harmony in classical logic then lies in strengthening the theory of the conditional so that the positive logic contains the full classical theory of the conditional. This is achieved by allowing parametric formulae in the natural deduction proofs, a form of multiple-conclusion logic.

classical negation Dummett fundamental assumption Gentzen multiple-conclusion logic 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Belnap, N. (1961–62): Tonk, plonk and plink, Analysis 22, 30–34.Google Scholar
  2. Boricic, B. (1985): On sequence-conclusion natural deduction systems, J. Philos. Logic 14, 359–377.Google Scholar
  3. Carnap, R. (1937): The Logical Syntax of Language, Routledge, London.Google Scholar
  4. Church, A. (1956): Introduction to Mathematical Logic, Princeton University Press, Princeton.Google Scholar
  5. Dummett, M. (1991): The Logical Basis of Metaphysics, Harvard University Press, Cambridge, Mass.Google Scholar
  6. Gentzen, G. (1969): Untersuchungen über das logische Schliessen, in The Collected Papers of Gerhard Gentzen, tr. M. Szabo, North-Holland, Amsterdam.Google Scholar
  7. Hacking, I. (1979): What is logic?, J. Philos. 76, 285–319.Google Scholar
  8. Isaacson, D. (1992): Some considerations on arithmetical truth and the ω-rule, in M. Detlefsen (ed.), Proof, Logic and Formalization, Routledge, London.Google Scholar
  9. Milne, P. (1998): Disjunction and disjunctive syllogism, Canad. J. Philos. 28, 21–32.Google Scholar
  10. Nordström, B., Petersson, K. and Smith, J. (1990): Programming in Martin-Löf's Type Theory, Clarendon Press, Oxford.Google Scholar
  11. Prawitz, D. (1965): Natural Deduction, Almqvist and Wiksell, Stockholm.Google Scholar
  12. Prawitz, D. (1973): Towards a foundation of general proof theory, in P. Suppes et al. (eds), Logic, Methodology and Philosophy of Science, IV, North-Holland, Amsterdam.Google Scholar
  13. Prawitz, D. (1977): Meaning and proofs: On the conflict between intuitionistic and classical logic, Theoria 43, 2–40.Google Scholar
  14. Prawitz, D. (1994): Review ofM. Dummett ‘The Logical Basis ofMetaphysics’, Mind 103, 373–376.Google Scholar
  15. Prior, A. (1960–61): The runabout inference ticket, Analysis 21, 38–39.Google Scholar
  16. Read, S. (1992): Conditionals are not truth-functional: An argument from Peirce, Analysis 52, 5–12.Google Scholar
  17. Read, S. (1994): Formal and material consequence, J. Philos. Logic 23, 247–265.Google Scholar
  18. Shapiro, S. (1998): Induction and indefinite extensibility: The Gödel sentence is true, but did someone change the subject?, Mind 107, 597–624.Google Scholar
  19. Shoesmith, D. and Smiley, T. (1978): Multiple-Conclusion Logic, Cambridge University Press, Cambridge.Google Scholar
  20. Sundholm, G. (1981): Hacking's logic, J. Philos. 78, 160–168.Google Scholar
  21. Tarski, A. (1956): Fundamental concepts of the methodology of the deductive sciences, in Logic, Semantics, Metamathematics, ed. and tr. J. Woodger, Clarendon Press, Oxford, pp. 60–109.Google Scholar
  22. Troelstra, A. and Schwichtenberg, H. (1996): Basic Proof Theory, Cambridge Univ. Press, Cambridge.Google Scholar
  23. Ungar, A. M. (1992): Normalization, Cut-Elimination and the Theory of Proofs, CSLI, Stanford.Google Scholar
  24. von Kutschera, F. (1962): Zum Deduktionsbegriff der klassischen Prädikatenlogik erster Stufe, in H. von Max Käsbauer and F. von Kutschera (eds), Logik und Logikkalkül, Alber, Freiburg, pp. 211–.Google Scholar

Copyright information

© Kluwer Academic Publishers 2000

Authors and Affiliations

  • Stephen Read
    • 1
  1. 1.Department of Logic and MetaphysicsUniversity of St Andrews, FifeScotlandU.K.

Personalised recommendations