Hostname: page-component-848d4c4894-m9kch Total loading time: 0 Render date: 2024-05-01T03:48:44.106Z Has data issue: false hasContentIssue false
  • English
  • Français

On the incompleteness theorems

Published online by Cambridge University Press:  12 March 2014

Henryk Kotlarski
Henryk Kotlarski*
Affiliation:
Katedra Matematyki WSRP w Siedlcach, ul. Orlicz-Dreszera 19/21, 08-110 Siedlce, Poland, E-mail: klarski@plearn.bitnet
Get access Rights & Permissions [Opens in a new window]

Abstract

We give new proofs of both incompleteness theorems. We do not use the diagonalization lemma, but work with some quickly growing functions instead.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 59 , Issue 4 , December 1994 , pp. 1414 - 1419
Copyright
Copyright © Association for Symbolic Logic 1994

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[F]Feferman, S., Arithmetization of metamathematics in a general setting, Fundamenta Mathematicae, vol. 49 (1960), pp. 35–92.CrossRefGoogle Scholar
[HP]Hájek, P. and Pudlák, P., Metamathematics of first order arithmetic, Perspectives in Mathematical Logic, Springer Verlag, Berlin, 1993.Google Scholar
[K]Kaye, R., Models of Peano arithmetic, Oxford Logic Guides, vol. 15, Oxford University Press, Oxford, 1991.Google Scholar
[Sh]Shoenfield, J. R., Mathematical logic, Addison-Wesley, Reading, Massachusetts, 1967.Google Scholar
[Sm]Smoryński, C., The incompleteness theorems, Handbook of mathematical logic (Barwise, J., editor), North-Holland, Amsterdam, 1977, pp. 821–865.CrossRefGoogle Scholar