On Formally Undecidable Propositions of Principia Mathematica and Related Systems

New York, NY, USA: Basic Books (1931)
  Copy   BIBTEX

Abstract

First English translation of revolutionary paper that established that even in elementary parts of arithmetic, there are propositions which cannot be proved or disproved within the system. Introduction by R. B. Braithwaite.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,881

External links

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

Through your library

Similar books and articles

Frege and Gödel: Two Fundamental Texts in Mathematical Logic.Jean Van Heijenoort - 1970 - Cambridge, MA: Harvard University Press. Edited by Gottlob Frege & Kurt Gödel.
Completeness and the Ends of Axiomatization.Michael Detlefsen - 2014 - In Juliette Cara Kennedy (ed.), Interpreting Gödel. New York: Cambridge University Press. pp. 59-77.
Proper Definition in "Principia Mathematica".C. G. Morgan - 1973 - International Logic Review 7:80.
Quantification Theory in *9 of Principia Mathematica.Gregory Landini - 2000 - History and Philosophy of Logic 21 (1):57-77.

Analytics

Added to PP
2021-11-17

Downloads
48 (#331,327)

6 months
12 (#213,779)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Intentional gaps in mathematical proofs.Don Fallis - 2003 - Synthese 134 (1-2):45 - 69.
Communication and strong compositionality.Peter Pagin - 2003 - Journal of Philosophical Logic 32 (3):287-322.
Church's Thesis and the Conceptual Analysis of Computability.Michael Rescorla - 2007 - Notre Dame Journal of Formal Logic 48 (2):253-280.
The computational theory of mind.Steven Horst - 2005 - Stanford Encyclopedia of Philosophy.

View all 48 citations / Add more citations

References found in this work

No references found.

Add more references