A System of Arithmetic in Modal Logic

Dissertation, Yale University (1981)
  Copy   BIBTEX

Abstract

A formal system of arithmetic in quantified modal logic is defined and investigated. The system is consistent with the philosophic attitudes of nominalism and finitism. The system is obtained from a typical Peano-style axiomatization of arithmetic in first-order logic by the application of a translation function mapping first-order formulas into modal formulas. The axioms obtained via this translation are shown to be true when the primitive terms of the language of arithmetic are interpreted as predicates of physical objects. It is further shown that classical logic is preserved under this translation, and, in particular, that excluded middle holds. ;The consequences of this seeming proof that finitism and classical logic are compatible are explored. Hilbert's philosophy of mathematics is criticized. Under an interpretation of the primitive terms which makes them predicates of mental objects or mental constructions, the modal axioms of the system prove true; this fact is used in a critique of intuitionism. ;The necessity of the truth of arithmetic truths is formally provable in the system; just what necessary truth means is analyzed in terms of how it is proved, and the conclusion is reached that any system of arithmetic which accomplishes philosophic aims similar to those of the system developed in this dissertation--the justification of finitism and nominalism and the preservation of classical logic--must presuppose, in its foundations, the doctrine of essentialism. ;The translation can be applied to first-order theories other than arithmetic. Some general results about its application are proved, and a sketch of the requirements of the modal development of set theory and analysis is offered

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,854

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

Quantum Mathematics.J. Michael Dunn - 1980 - PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1980:512 - 531.
Arithmetic Formulated Relevantly.Robert Meyer - 2021 - Australasian Journal of Logic 18 (5):154-288.
A new "feasible" arithmetic.Stephen Bellantoni & Martin Hofmann - 2002 - Journal of Symbolic Logic 67 (1):104-116.
Axiomatizing higher-order Kleene realizability.Jaap van Oosten - 1994 - Annals of Pure and Applied Logic 70 (1):87-111.
A Realizability Interpretation for Classical Arithmetic.Jeremy Avigad - 2002 - Bulletin of Symbolic Logic 8 (3):439-440.
Godel's theorem in retrospect.Martin Tabakov - 1984 - Bulletin of the Section of Logic 13 (3):132-134.
Unfolding finitist arithmetic.Solomon Feferman & Thomas Strahm - 2010 - Review of Symbolic Logic 3 (4):665-689.

Analytics

Added to PP
2015-02-05

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?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references