Arithmetical truth and hidden higher-order concepts

In Logic Colloquium '85: Proceedings of the Colloquium held in Orsay, France July 1985 (Studies in Logic and the Foundations of Mathematics, Vol. 122.). Amsterdam, New York, Oxford, Tokyo: North-Holland. pp. 147-169 (1987)
  Copy   BIBTEX

Abstract

The incompleteness of formal systems for arithmetic has been a recognized fact of mathematics. The term “incompleteness” suggests that the formal system in question fails to offer a deduction which it ought to. This chapter focuses on the status of a formal system, Peano Arithmetic, and explores a viewpoint on which Peano Arithmetic occupies an intrinsic, conceptually well-defined region of arithmetical truth. The idea is that it consists of those truths which can be perceived directly from the purely arithmetical content of a categorical conceptual analysis of the notion of natural number. The chapter explores its conceptual stability in light of the apparently destabilizing effect, through extensibility, of the phenomenon of incompleteness. It also offers heuristic and conceptual support for the viewpoint that Peano Arithmetic is the strongest natural first-order system for arithmetic, and that there is a sense in which it is complete with respect to purely arithmetical truth.

Links

PhilArchive



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

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 Quantum Strategy of Completeness: On the Self-Foundation of Mathematics.Vasil Penchev - 2020 - Cultural Anthropology eJournal (Elsevier: SSRN) 5 (136):1-12.
Svojstva klasične logike [Properties of Classical Logic].Srećko Kovač - 2013 - Zagreb: Hrvatski studiji Sveučilišta u Zagrebu.
Quantum Mathematics.J. Michael Dunn - 1980 - PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1980:512 - 531.
Interpretability over peano arithmetic.Claes Strannegård - 1999 - Journal of Symbolic Logic 64 (4):1407-1425.
Minimal truth and interpretability.Martin Fischer - 2009 - Review of Symbolic Logic 2 (4):799-815.
Interpretability over peano arithmetic.Claes Strannegård - 1999 - Journal of Symbolic Logic 64 (4):1407-1425.
The Gödel Incompleteness Theorems (1931) by the Axiom of Choice.Vasil Penchev - 2020 - Econometrics: Mathematical Methods and Programming eJournal (Elsevier: SSRN) 13 (39):1-4.

Analytics

Added to PP
2023-07-16

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?

Author's Profile

References found in this work

No references found.

Add more references