First-order peano arithmetic

Abstract

Theorem 1. If T is a sound formalized theory whose language contains the language of basic arithmetic, then there will be a true sentence GT of basic arithmetic such that T ￿ GT and ￿ ¬GT, so T must be negation incomplete.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,779

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

  • Only published works are available at libraries.

Similar books and articles

Quantum Mathematics.J. Michael Dunn - 1980 - PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1980:512 - 531.
Solovay's theorem cannot be simplified.Andrew Arana - 2001 - Annals of Pure and Applied Logic 112 (1):27-41.
Arithmetic Formulated Relevantly.Robert Meyer - 2021 - Australasian Journal of Logic 18 (5):154-288.

Analytics

Added to PP
2009-11-21

Downloads
21 (#726,807)

6 months
21 (#166,473)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Peter Eldridge-Smith
Australian National University

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references