Abstract
In this section we show how the syntax of formal languages reduces in principle to arithmetic. We do this by identifying the symbols, expressions, and texts in a finite or countable alphabet A with certain natural numbers (i.e., by numbering them) in such a way that the syntactic operations (juxtaposition, substitution, etc.) are represented by recursive functions, and the syntactic relations (occurrence in an expression, “being a formula,” etc.) are represented by decidable or enumerable sets.
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1977 Springer Science+Business Media New York
About this chapter
Cite this chapter
Manin, Y.I. (1977). Gödel’s incompleteness theorem. In: A Course in Mathematical Logic. Graduate Texts in Mathematics, vol 53. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-4385-2_7
Download citation
DOI: https://doi.org/10.1007/978-1-4757-4385-2_7
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4757-4387-6
Online ISBN: 978-1-4757-4385-2
eBook Packages: Springer Book Archive