Skip to main content

Wittgenstein on Incompleteness Makes Paraconsistent Sense

  • Chapter
  • First Online:
Book cover Paraconsistency: Logic and Applications

Part of the book series: Logic, Epistemology, and the Unity of Science ((LEUS,volume 26))

  • 1052 Accesses

Abstract

I provide an interpretation of Wittgenstein’s much criticised remarks on Gödel’s First Incompleteness Theorem in a paraconsistent framework: in taking Gödel’s proof as a paradoxical derivation, Wittgenstein was consequent upon his deliberate rejection of the standard distinction between theory and metatheory. The reasoning behind the proof of the truth of the Gödel sentence is then performed within the formal system itself, which turns out to be inconsistent. I show that the model-theoretic features of paraconsistent arithmetics match with many intuitions underlying Wittgenstein’s philosophy of mathematics, such as its strict finitism and the insistence on the decidability of any mathematical question.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    In the correspondence between the two mathematicians, as Dawson points out, Zermelo “failed utterly to appreciate Gödel’s distinctions between syntax and semantics” (Dawson 1984, p. 80).

  2. 2.

    Wittgenstein’s remarks had as their background system the one of Russell and Whitehead’s Principia mathematica (with slight modifications). However, this is a minor point, and sticking to PA allows us to follow a standard way of presenting Gödel’s Theorems.

  3. 3.

    Or, at least, these are our bona fide intuitions when we formulate the theory. The existence of non-standard models shows that things are not so straightforward. I will come to this in a subsequent note.

  4. 4.

    Th is not recursive, but semirecursive (see Gödel 1931, p. 606); however, this is of no importance here.

  5. 5.

    One of the consequences of Gödel’s First Theorem is that (first-order) PA is not, as model theorists say, categorical. This means that from Gödel’s results follows the existence of non-standard models of PA, structurally different from \(\mathbb{N}\). In particular, there is no way to constrain the variables of the theory so that they range exclusively on ordinary natural numbers. In 1957, Goodstein had already claimed that “Wittgenstein with remarkable insight said in the early thirties that Gödel’s results showed that the notion of a finite cardinal could not be expressed in an axiomatic system and that formal number variables must necessarily take values other than natural numbers” (Goodstein 1957, p. 551). More recently, Floyd and Putnam have credited the “notorious paragraph” 8 of the Appendix 1 to Part I of Wittgenstein’s Bemerkungen with a “philosophical claim of great interest” precisely on the role of non-standard models and ω-inconsistency. The claim is to the effect that “if one assumes (and, a fortiori, if one actually finds out) that ¬P [where P is assumed to be the Gödel sentence of the relevant system] is provable in Russell’s system one should (or, as Wittgenstein actually writes, one ‘will now presumably’) give up the ‘translation’ of P by the English sentence ‘P is not provable”’ (Floyd and Putnam 2000, p. 625). The point is that if a theory proves ¬P (which may be obtained simply by adding it as an axiom), then it is ω-inconsistent, but consistent. Being consistent, it is supposed to have a model. However, being ω-inconsistent, its model has to be structurally different from the standard model of arithmetics, \(\mathbb{N}\). It is a non-standard model, and the “translation” of P as “P is not provable” becomes untenable in this context.

  6. 6.

    An anonymous referee has appropriately pointed out to me.

  7. 7.

    In Kleene’s words: “Gödel’s sentence ’I am unprovable’ is not paradoxical. We escape paradox because (whatever Hilbert may have hoped) there is no a priori reason why every true sentence must be provable […]. The sentence A p (p), which says ’I am unprovable’, is simply unprovable and true” (Kleene 1976, p. 54).

  8. 8.

    That at the core of Wittgenstein’s rejection of the Platonistic “prose” associated to Gödel’s proof is his identification of truth with provability, has been argued in detail by Rodych and Shanker in various essays (see Rodych 19992003; Shanker 1988).

  9. 9.

    In particular, Priest may disagree with the picture of Wittgenstein’s attitude towards Gödel proposed here (see Priest 2004).

  10. 10.

    For a quick review, see Bremer (2005, Chap. 13).

  11. 11.

    Such a strict finitism is not unavoidably tied to inconsistency, nonetheless: van Bendegem (19941999) has exploited the properties of paraconsistent arithmetical models to argue for a greatest number, which is not an inconsistent one.

  12. 12.

    For a detailed account of these facts, see Priest (1994, pp. 337–338) and Priest (1987, pp.  234–237).

  13. 13.

    See Priest (1994, pp. 346–347); the result was anticipated in Dunn (1979).

  14. 14.

    One of the consequences of the downward Theorem is the so-called Skolem paradox. Since set theory can be expressed in a first-order language, it has a model whose domain has the cardinality of the set of natural numbers. However, within set theory we can prove the existence of sets whose cardinality is more than denumerable.

References

  • Ambrose, A., and M. Lazerowitz (eds.). 1972. Ludwig wittgenstein: Philosophy and language. London: Allen and Unwin.

    Google Scholar 

  • Anderson, A.R. 1958. Mathematics and the ‘Language Game’. In Philosophy of mathematics. Selected readings, ed. P. Benacerraf, H. Putnam, 481–490. Prentice Hall: Englewood Cliffs.

    Google Scholar 

  • Benacerraf, P., and H. Putnam (eds.). 1964. Philosophy of mathematics. Selected readings. Prentice Hall: Englewood Cliffs.

    Google Scholar 

  • Bernays, P. 1959. Comments on ludwig Wittgenstein’s remarks on the foundations of mathematics. In Philosophy of mathematics. Selected readings, ed. P. Benacerraf, H. Putnam, 481–490. Prentice Hall: Englewood Cliffs.

    Google Scholar 

  • Boolos, G.S., J.P. Burgess, and R. Jeffrey. 2002. Computability and logic, 4th ed. Cambridge: Cambridge University Press.

    Book  Google Scholar 

  • Bremer, M. 2005. An Introduction to paraconsistent logics, Frankfurt: Peter Lang.

    Google Scholar 

  • Church, A. 1956. Introduction to mathematical logic, Princeton: Princeton University Press.

    Google Scholar 

  • Davidson, D. 1984. Inquiries into truth and interpretation. Oxford: Clarendon Press.

    Google Scholar 

  • Dawson, W. 1984. The reception of Gödel’s incompleteness theorems. Philosophy of science association 2, 74–95. Reprinted in Shanker (1988).

    Google Scholar 

  • Dummett, M. 1959. Wittgenstein’s philosophy of mathematics. In Philosophy of mathematics. Selected readings, ed. P. Benacerraf, H. Putnam, 481–490. Prentice Hall: Englewood Cliffs.

    Google Scholar 

  • Dummett, M. 1978. Truth and other enigmas. London: Duckworth.

    Google Scholar 

  • Dunn, J.M. 1979. A theorem in 3-valued model theory with connections to number theory, type theory and relevant logic. Studia Logica 38: 149–169.

    Article  Google Scholar 

  • Feferman, S. 1983. Kurt Gödel: Conviction and caution. In Gödel’s theorem in focus, ed. S.G. Shanker, 96–114. London: Croom Helm.

    Google Scholar 

  • Floyd, J. 2001. Prose versus proof: Wittgenstein on Gödel, tarski and truth. Philosophia mathematica 9: 280–307.

    Article  Google Scholar 

  • Floyd, J., and H. Putnam. 2000. A note on wittgenstein’s ‘Notorious Paragraph’ about the Gödel theorem. Journal of Philosophy 97: 624–632.

    Article  Google Scholar 

  • Gödel, K. (1931). Über formal unentscheidbare Sätze der Principia mathematica und verwandter systeme I. Monatshefte fr Mathematik und Physik 38: 173–198, translated as: On formally undecidable propositions of principia mathematica and related systems I. In From Frege to Gödel. A source book in mathematical logic, ed. J. van Heijenoort, 596–617. Harvard: Harvard University Press.

    Google Scholar 

  • Gödel, K. 1944. Russell’s mathematical logic. In The philosophy of bertrand russell, ed. P.A. Schlipp, 125–153. Evanston: Northwestern University Press.

    Google Scholar 

  • Gödel, K. 1947. What is cantor’s continuum problem? American Mathematical Monthly 54: 515–525.

    Article  Google Scholar 

  • Goodstein, R. 1957. Critical notice of remarks on the foundations of mathematics. Mind 66: 549–553.

    Article  Google Scholar 

  • Goodstein, R. 1972. Wittgenstein’s philosophy of mathematics. In Ludwig Wittgenstein: Philosophy and Language, ed. A. Ambrose and M. Lazerowitz, 271–286. London: Allen and Unwin.

    Google Scholar 

  • Helmer, O. 1937. Perelman versus Gödel. Mind 46: 58–60.

    Article  Google Scholar 

  • Hintikka, J. 1999. Ludwig Wittgenstein: Half truths and one-and-a-half truths. In Selected papers, vol. I, ed. J. Hintikka. Dordrecht: Kluwer.

    Google Scholar 

  • Holbel, M., and B. Weiss (eds.). 2004. Wittgenstein’s lasting significance. London/New York: Routledge.

    Google Scholar 

  • Kielkopf, C. 1970. Strict finitism: An examination of ludwig Wittgenstein’s remarks on the foundations of mathematics. The Hague: Mouton.

    Google Scholar 

  • Kleene, S. 1976. The work of Kurt Gödel. Journal of Symbolic Logic 41: 761–778. Reprinted in Shanker (1988), 48–73.

    Google Scholar 

  • Kreisel, G. 1958. Review of Wittgenstein’s ‘remarks on the foundations of mathematics’. British Journal for the Philosophy of Science 9: 135–158.

    Article  Google Scholar 

  • Marconi, D. 1984. Wittgenstein on contradiction and the philosophy of paraconsistent logics. History of Philosophy Quarterly 1: 333–352.

    Google Scholar 

  • Meyer, R.K., and C. Mortensen. 1984. Inconsistent models for relevant arithmetic. Journal of Symbolic Logic 49: 917–929.

    Article  Google Scholar 

  • Perelman, C. (1936). L’Antinomie de M. Gödel. Acadmie Royale de Belgique, Bulletin de la Classe des Sciences 5(22): 730–733.

    Google Scholar 

  • Priest, G. 1979. The logic of paradox. Journal of Philosophical Logic 8: 219–241.

    Article  Google Scholar 

  • Priest, G. 1984. Logic of paradox revisited. Journal of Philosophical Logic 13: 153–179.

    Article  Google Scholar 

  • Priest, G. 1987. In contradiction: A study of the transconsistent. Dordrecht: Martinus Nijhoff; 2nd expanded edition (2006) Oxford: Oxford University Press.

    Google Scholar 

  • Priest, G. 1994. Is arithmetic consistent? Mind 103: 337–349.

    Article  Google Scholar 

  • Priest, G. 1995. Beyond the limits of thought. Cambridge: Cambridge University Press.

    Google Scholar 

  • Priest, G. 2004. Wittgenstein’s remarks on Gödel’s theorem. In Wittgenstein’s lasting significance, ed. M. Holbel, and B. Weiss. London/New York: Routledge.

    Google Scholar 

  • Rodych, V. 1999. Wittgenstein’s inversion of Gödel’s theorem. Erkenntnis 51: 173–206.

    Article  Google Scholar 

  • Rodych, V. 2002. Wittgenstein on Gödel: The newly published remarks. Erkenntnis 56: 379–397.

    Article  Google Scholar 

  • Rodych, V. 2003. Misunderstanding Gödel: New arguments about Wittgenstein and new remarks by Wittgenstein. Dialectica, 57: 279–313.

    Article  Google Scholar 

  • Routley, R. 1979. Dialectical logic, semantics and metamathematics. Erkenntnis 14: 301–331.

    Article  Google Scholar 

  • Shanker, S.G. (ed.). 1988. Gödel’s theorem in focus. London: Croom Helm.

    Google Scholar 

  • Smullyan, R. 1992. Gödel’s incompleteness theorems. Oxford: Oxford University Press.

    Google Scholar 

  • Tarski, A. 1956. Logic, semantics, metamathematics. Papers from 1923 to 1938. Oxford: Oxford University Press.

    Google Scholar 

  • van Bendegem, J.-P. 1994. Strict finitism as a viable alternative in the foundations of mathematics. Logique et Analyse 137: 23–40.

    Google Scholar 

  • van Bendegem, J.-P. 1999. Why the largest number imaginable is still a finite number. Logique et Analyse 165–166: 107–126.

    Google Scholar 

  • van Heijenoort, J. (ed.). 1967. From Frege to Gödel. A source book in mathematical logic. Harvard: Harvard University Press.

    Google Scholar 

  • Wittgenstein, L. 1921. Logisch-philosophische Abhandlung. Annalen der Naturphilosophie, vol. 14. London: Routledge and Kegan Paul; Revised edition 1922. Tractatus logico-philosophicus, Reprinted New York: Barnes and Noble.

    Google Scholar 

  • Wittgenstein, L. 1953. Philosophische Untersuchungen. Oxford: Basil Blackwell.

    Google Scholar 

  • Wittgenstein, L. 1956. Bemerkungen über die Grundlagen der mathematik. Oxford: Basil Blackwell.

    Google Scholar 

  • Wittgenstein, L. 1964. Philosophische bemerkungen. Oxford: Basil Blackwell.

    Google Scholar 

  • Wittgenstein, L. 1974. Philosophische grammatik. Oxford: Basil Blackwell.

    Google Scholar 

  • Wittgenstein, L. 1976. Lectures on the foundations of mathematics. Ithaca: Cornell University Press.

    Google Scholar 

Download references

Acknowledgements

The non-technical parts of this work draw on a paper published in Philosophia Mathematica, 17: 208–219, with the title “The Gödel Paradox and Wittgenstein’s Reasons”. I am grateful to Oxford University Press and to the Editors of Philosophia Mathematica for permission to reuse that material. I am also grateful to an anonymous referee for helpful comments on this expanded version.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Francesco Berto .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer Science+Business Media Dordrecht.

About this chapter

Cite this chapter

Berto, F. (2013). Wittgenstein on Incompleteness Makes Paraconsistent Sense. In: Tanaka, K., Berto, F., Mares, E., Paoli, F. (eds) Paraconsistency: Logic and Applications. Logic, Epistemology, and the Unity of Science, vol 26. Springer, Dordrecht. https://doi.org/10.1007/978-94-007-4438-7_14

Download citation

Publish with us

Policies and ethics