Sentences Undecidable in Formalized Arithmetic: An Exposition of the Theory of Kurt Gödel

British Journal for the Philosophy of Science 3 (12):364-374 (1953)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,682

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

The Diagonal Method in Formalized Arithmetic. [REVIEW]G. Kreisel - 1953 - British Journal for the Philosophy of Science 3 (12):364-374.
Arithmetic Proof and Open Sentences.Neil Thompson - 2012 - Philosophy Study 2 (1):43-50.
Some results on measure independent gödel speed-ups.Martin K. Solomon - 1978 - Journal of Symbolic Logic 43 (4):667-672.
The interpretability logic of peano arithmetic.Alessandro Berarducci - 1990 - Journal of Symbolic Logic 55 (3):1059-1089.
On Gödel Sentences and What They Say.Peter Milne - 2007 - Philosophia Mathematica 15 (2):193-226.
Weak Theories of Concatenation and Arithmetic.Yoshihiro Horihata - 2012 - Notre Dame Journal of Formal Logic 53 (2):203-222.
Incompleteness and inconsistency.Stewart Shapiro - 2002 - Mind 111 (444):817-832.

Analytics

Added to PP
2017-02-20

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

References found in this work

No references found.

Add more references