Abstract
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’
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
Eisenstadt, S. A. and H. A. Simon: 1997, ‘Logic and Thought’, Minds and Machines 7, 365–85.
Mendelson, E.: 1964, Introduction to Mathematical Logic, Van Nostrand, Princeton, NJ.
Richman, H. B., J. J. Staszewski, and H. A. Simon: 1995, ‘Simulation of Expert Memory Using EPAM IV’, Psychological Review 102, 305–30.
Shoenfield, J. R.: 1967, Mathematical Logic, Addison-Wesley, Reading, MA.
Siklóssy, L.: 1972, ‘Natural Language Learning by Computer’, in H. A. Simon and L. Siklóssy (eds.), Representation and Meaning, Prentice-Hall, Englewood Cliffs, NJ.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Simon, H.A., Eisenstadt, S.A. Human and Machine Interpretation of Expressions in Formal Systems. Synthese 116, 439–461 (1998). https://doi.org/10.1023/A:1005053105533
Issue Date:
DOI: https://doi.org/10.1023/A:1005053105533