- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Sentences undecidable in formalized arithmetic: an exposition of the theory of Kurt Gödel
Westport, Conn.: Greenwood Press (1952)
Abstract
The famous theory of undecidable sentences created by Kurt Godel in 1931 is presented as clearly and as rigorously as possible. Introductory explanations beginning with the necessary facts of arithmetic of integers and progressing to the theory of representability of arithmetical functions and relations in the system (S) prepare the reader for the systematic exposition of the theory of Godel which is taken up in the final chapter and the appendix.Other Versions
No versions found
Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
Mostowski Andrzej. Sentences undecidable in formalized arithmetic. An exposition of the theory of Kurt Gödel. Studies in logic and the foundations of mathematics. North-Holland Publishing Company, Amsterdam 1952, VIII + 117 pp. [REVIEW]G. Hasenjaeger - 1954 - Journal of Symbolic Logic 19 (2):119-121.
Sentences Undecidable in Formalized Arithmetic: An Exposition of the Theory of Kurt Gödel.A. Mostowski - 1953 - British Journal for the Philosophy of Science 3 (12):364-374.
Gödel's incompleteness theorems.Raymond M. Smullyan - 1992 - New York: Oxford University Press. Edited by Lou Goble.
Some results on measure independent gödel speed-ups.Martin K. Solomon - 1978 - Journal of Symbolic Logic 43 (4):667-672.
Kurt Gödel, paper on the incompleteness theorems (1931).Richard Zach - 2004 - In Ivor Grattan-Guinness, Landmark Writings in Mathematics. North-Holland. pp. 917-925.
Three universal representations of recursively enumerable sets.James P. Jones - 1978 - Journal of Symbolic Logic 43 (2):335-351.
Kurt gödel’s first steps in logic: Formal proofs in arithmetic and set theory through a system of natural deduction.Jan von Plato - 2018 - Bulletin of Symbolic Logic 24 (3):319-335.
Analytics
Added to PP
2009-01-28
Downloads
111 (#437,428)
6 months
26 (#386,251)
2009-01-28
Downloads
111 (#437,428)
6 months
26 (#386,251)
Historical graph of downloads
Citations of this work
Reflecting on believability: on the epistemic approach to justifying implicit commitments.Maciej Głowacki & Mateusz Łełyk - 2024 - Philosophical Studies 181 (11):3135-3163.
Reconsidering Gödel's Doctrine: Independence Results.Patrick J. Ryan - forthcoming - Review of Symbolic Logic.
An analysis of Dummett’s ‘On the Philosophical Significance of Gödel’s Theorem’.Jann Paul Engler - forthcoming - Erkenntnis:1-23.
Try MATCHA Writer if you're interested in citing directly from PhilPapers and certifying your authorship.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation