Skip to main content
Log in

Are Turing Machines Platonists? Inferentialism and the Computational Theory of Mind

  • Published:
Minds and Machines Aims and scope Submit manuscript

The assumption that we can effectively recognize a proof of a given statement of some mathematical theory, say elementary number theory, lies at the basis of all intuitionistic mathematics; but to hold that there is any recursive procedure for recognizing proofs of arithmetical statements would be to run foul of Gödel’s Incompleteness Theorem.—M. Dummett Elements of Intuitionism

Michael Dummett pointed out when I read the original paper to the Oxford Philosophical Society, I could be helped, indeed helped by all the mathematicians in the world, who might be keen to see a mind, even mine, defeat mechanism.—J. R. Lucas “The Gödelian Argument: Turn Over the Page”

Abstract

We first discuss Michael Dummett’s philosophy of mathematics and Robert Brandom’s philosophy of language to demonstrate that inferentialism entails the falsity of Church’s Thesis and, as a consequence, the Computational Theory of Mind. This amounts to an entirely novel critique of mechanism in the philosophy of mind, one we show to have tremendous advantages over the traditional Lucas-Penrose argument.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Notes

  1. Exactly how this must go is much more complicated, and philosophically interesting, than would first appear (Cogburn 2004).

  2. It must be noted that this argument is independent of issues concerning intuitionism. While the Dummettian intuitionist must accept the conclusion, so must one who (albeit perhaps mistakenly) believes that verificationism, the manifestation requirement, and molecularism can be consistently held by a defender of the universal validity of strictly classical (non-intuitionist) inferences such as the law of excluded middle or double negation elimination.

  3. Proofs of the relevant lemmas from this section can be found in any good book on logic and computability theory (Boolos and Jeffrey 1989; Epstein and Carnielli 1999).

  4. If it weren’t for the role molecularism plays, our argument might be considered to be merely an interpretation of what Dummett seemed to have in mind in the epigram at the beginning of this paper. Dummett seems to be asserting that the manifestation requirement is inconsistent with Church’s Thesis. However, we’ve shown this not to be true. Rather, the manifestation requirement, verificationism, and molecularism are jointly inconsistent with Church’s Thesis. Also note that it is not at all clear to many contemporary intuitionist anti-realists that Church’s Thesis is false. In fact, two noted arguments for intuitionism (Dragalin 1988; Tenant 1997) use Church’s Thesis as a premise! It is a consequence of the current paper that it is no accident that Dummett’s own arguments (Cogburn 2000; Cogburn 2005d) never do.

  5. Of course, Dummett’s own views apply outside of mathematics, though their original motivation concerned worries about infinity. By focusing on one each of Dummett and Sellars’ intellectual heirs, we hope that our discussion will further rapprochement between these two schools of thought.

  6. In the case of cashing out distinctively empirical concepts this is a non-trivial and important addition, as Dummettian harmony does fail in important ways once we leave the realm of logic and mathematics. Explicating this issue would bring us too far afield of the current argument though.

  7. This comes from Sellar’s classic paper, “Meaning as Functional Classification,” which describes the three types of pattern governed linguistic behavior.

    (1) Language Entry Transitions: The speaker responds to objects in perceptual situations, and in certain states of himself, with appropriate linguistic activity.

    (2) Intra-linguistic Moves: The speaker’s linguistic conceptual episodes tend to occur in patters of valid inferences (theoretical and practical), and tend not to occur in patterns which violate logical principles.

    (3) Language Departure Transitions: The speaker responds to such linguistic conceptual episodes as ‘I will now raise my hand’ with an upward motion of the hand, etc. (Sellars 1980, 423–424)

    Elsewhere (Cogburn 2005a) one of the authors ties this to both Dummett and Christopher Peacocke’s views about content.

  8. Incidentally, this shows why Brandom should not find intuitionistically unacceptable principles to be logical principles. Classical negation does not conservatively extend intuitionistic logic. When one adds classical negation rules to the introduction and elimination rules for the other logical operators, one can derive Putnam’s Theorem (P → Q) ∨ (Q → P), which does not contain negation. Intuitionist negation, on the other hand, does conservatively extend the negation free fragment of the logic.

  9. As is pointed out by Wright, this ‘disjunctive view’ seems to be the view endorsed by Gödel himself in his famous Gibbs lecture.

  10. The source material for these quotes (Lucas 2002) is a web page, so page numbers are not given.

  11. One must note that our proof does rely on the performance-competence distinction. The ability to recognize proofs at the heart of mathematical understanding is an idealized procedure instantiated by understanders. However, as has been shown (Cogburn 2005b) the idealization must be pretty tightly tied to inferential behavior of actual people. Unlike the case of proof recognition, it is not clear how the idealized ability to recognize one’s own Gödel sentence is tied to actual inferential behavior. So there is an important distinction between our appeal and Wright’s. However, conceding the point to Wright is not a large concession. It will be clear that Detlefsen’s critique of Wright does not affect our argument.

References

  • Belnap, N. D. (1962). Tonk, plonk, and plink. Analysis, 22, 130–134.

    Article  Google Scholar 

  • Benacerraf, P. (1967). God, the devil and Gödel. The Monist, 51, 9–32.

    Google Scholar 

  • Boolos, G., & Jeffrey, C. (1989). Computability and logic (3rd ed.). Cambridge: Cambridge University Press.

    MATH  Google Scholar 

  • Brandom, R. (2000). Articulating reasons (an introduction to inferentialism). Cambridge: Harvard University Press.

    Google Scholar 

  • Cogburn, J. (2000). Logical revision re-revisited: The Wright/Salerno argument for intuitionism. Philosophical Studies, 60.1, 5–12.

    MathSciNet  Google Scholar 

  • Cogburn, J. (2004). The philosophical basis of what? The anti-realist case for dialethism. In G. Priest, J. C. Beall, & B. Armour Garb (Eds.), The law of non-contradiction. Oxford: Oxford University Press.

    Google Scholar 

  • Cogburn, J. (2005a). The logic of logical revision: Formalizing Dummett’s argument. The Australasian Journal of Philosophy, 83.1, 15–32.

    Article  Google Scholar 

  • Cogburn, J. (2005b). Tonking a theory of content: An inferentialist rejoinder. Logic and Logical Philosophy, 13, 31–36.

    MathSciNet  Google Scholar 

  • Cogburn, J. (2005c). Inferentialism and tacit knowledge. Behavior and Philosophy, 32, 503–524.

    Google Scholar 

  • Cogburn, J. (2005d). The logic of logical revision: Formalizing Dummett’s argument. The Australasian Journal of Philosophy, 83, 15–32.

    Article  Google Scholar 

  • Detlefsen, M. (1995). Wright on the non-mechanizability of intuitionist reasoning. Philosophia Mathematica, 3, 103–119.

    Article  MATH  MathSciNet  Google Scholar 

  • Dragalin, A. (1988). Mathematical intuitionism: Introduction to proof theory. Providence: America Mathematical Society.

    MATH  Google Scholar 

  • Dummett, M. (1991). The logical basis of metaphysics. Cambridge: Harvard University Press.

    Google Scholar 

  • Epstein, R. L., & Carnielli, A. (1999). Computability: Computable functions, logic, and the foundations of mathematics. Wadsworth: Thomson Learning.

    Google Scholar 

  • Gödel, K. (1951). Josiah Willard Gibbs lecture. In S. Feferman (Ed.), K. Gödel collected works (Vol. III). Oxford: Oxford University Press.

    Google Scholar 

  • Lucas, J. R. (2002). The Gödelian argument: Turn over the page. http://users.ox.ac.uk/~jrlucas/turn.html. Cited October 4, 2002.

  • Penrose, R. (1989). The emperor’s new mind. Oxford: Oxford University Press.

    Google Scholar 

  • Prior, A. N. (1960). The runabout inference ticket. Analysis, 21, 38–39.

    Article  Google Scholar 

  • Putnam, H. (1960). Minds and machines. In S. Hook (Ed.), Dimensions of mind (pp. 138–164). New York: New York University Press.

    Google Scholar 

  • Putnam, H. (1995). Review of R. Penrose’s shadows of the mind. A search for the missing science of consciousness. Bulletin of the American Mathematical Society, 32, 370–373.

    Article  MathSciNet  Google Scholar 

  • Sellars, W. (1980). Inference and meaning. In J. Sicha (Ed.), Pure pragmatics and possible worlds. Reseda: Ridgeview Publishing Co.

    Google Scholar 

  • Tenant, N. (1997). The taming of the true. Oxford: Clarendon Press.

    Google Scholar 

  • Wright, C. (1995). Intuitionists are not (turing) machines. Philosophia Mathematica, 3, 86–102.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jon Cogburn.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cogburn, J., Megil, J. Are Turing Machines Platonists? Inferentialism and the Computational Theory of Mind. Minds & Machines 20, 423–439 (2010). https://doi.org/10.1007/s11023-010-9203-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11023-010-9203-1

Keywords

Navigation