Concrete Mathematical Incompleteness: Basic Emulation Theory

In John Burgess (ed.), Hilary Putnam on Logic and Mathematics. Cham: Springer Verlag (2018)
  Copy   BIBTEX

Abstract

there are mathematical statements that cannot be proved or refuted using the usual axioms and rules of inference of mathematics.

Links

PhilArchive



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

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

Reflections on Concrete Incompleteness.G. Longo - 2011 - Philosophia Mathematica 19 (3):255-280.
.[author unknown] - unknown
From closed to open systems.Carlo Cellucci - 1993 - In J. Czermak (ed.), Philosophy of Mathematics, pp. 206-220. Hölder-Pichler-Tempsky.
Alan Turing and the mathematical objection.Gualtiero Piccinini - 2003 - Minds and Machines 13 (1):23-48.
Independence and justification in mathematics.Krzysztof Wójtowicz - 2006 - Poznan Studies in the Philosophy of the Sciences and the Humanities 91 (1):349-373.
Gödel's incompleteness theorems.Raymond M. Smullyan - 1992 - New York: Oxford University Press. Edited by Lou Goble.

Analytics

Added to PP
2010-12-22

Downloads
231 (#86,188)

6 months
1 (#1,479,630)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references