Human and machine interpretation of expressions in formal systems

Synthese 116 (3):439-461 (1998)
  Copy   BIBTEX


This paper uses a proof of Gödels theorem, implemented on a computer, to explore how a person or a computer can examine such a proof, understand it, and evaluate its validity. It is argued that, in order to recognize it (1) as Gödel's theorem, and (2) as a proof that there is an undecidable statement in the language of PM, a person must possess a suitable semantics. As our analysis reveals no differences between the processes required by people and machines to understand Gödel's theorem and manipulate it symbolically, an effective way to characterize this semantics is to model the human cognitive system as a Turing Machine with sensory inputs. La logistique n'est plus stérile: elle engendre la contradicion! – Henri Poincaré ‘Les mathematiques et la logique’.



    Upload a copy of this work     Papers currently archived: 92,931

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library


Added to PP

60 (#274,547)

6 months
2 (#1,257,544)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Mathematical logic.Joseph R. Shoenfield - 1967 - Reading, Mass.,: Addison-Wesley.
Logic and thought.Stuart A. Eisenstadt & Herbert A. Simon - 1997 - Minds and Machines 7 (3):365-385.

Add more references