Is there a simple, pedestrian arithmetic sentence which is independent of zfc?

Synthese 125 (1-2):69-76 (2000)
  Copy   BIBTEX

Abstract

We show that the P 2 0 sentence, and explore some of theconsequences of that fact. This paper summarizes recent workby the author with N. C. A. da Costa on the P

Links

PhilArchive



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

External links

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

Through your library

Analytics

Added to PP
2009-01-28

Downloads
55 (#284,906)

6 months
6 (#512,819)

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

On the interpretation of non-finitist proofs–Part II.G. Kreisel - 1952 - Journal of Symbolic Logic 17 (1):43-58.
An Introduction to the General Theory of Algorithms.Michael Machtey & Paul Young - 1981 - Journal of Symbolic Logic 46 (4):877-878.
Accessible recursive functions.Stanley S. Wainer - 1999 - Bulletin of Symbolic Logic 5 (3):367-388.

Add more references