Relevant Robinson's arithmetic

Studia Logica 38 (4):407 - 418 (1979)
  Copy   BIBTEX

Abstract

In this paper two different formulations of Robinson's arithmetic based on relevant logic are examined. The formulation based on the natural numbers (including zero) is shown to collapse into classical Robinson's arithmetic, whereas the one based on the positive integers (excluding zero) is shown not to similarly collapse. Relations of these two formulations to R. K. Meyer's system R# of relevant Peano arithmetic are examined, and some remarks are made about the role of constant functions (e.g., multiplication by zero) in relevant arithmetic.

Links

PhilArchive



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

External links

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

Through your library

Similar books and articles

⊃E is Admissible in “true” relevant arithmetic.Robert K. Meyer - 1998 - Journal of Philosophical Logic 27 (4):327-351.
⊃E is Admissible in “true” relevant arithmetic.Robert K. Meyer - 1998 - Journal of Philosophical Logic 27 (4):327 - 351.
Quantum Mathematics.J. Michael Dunn - 1980 - PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1980:512 - 531.
In defense of epistemic arithmetic.Leon Horsten - 1998 - Synthese 116 (1):1-25.
Whither relevant arithmetic?Harvey Friedman & Robert K. Meyer - 1992 - Journal of Symbolic Logic 57 (3):824-831.

Analytics

Added to PP
2009-01-28

Downloads
50 (#310,395)

6 months
6 (#522,885)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Jon Michael Dunn
PhD: University of Pittsburgh; Last affiliation: Indiana University, Bloomington

Citations of this work

From Hilbert proofs to consecutions and back.Tore Fjetland Øgaard - 2021 - Australasian Journal of Logic 18 (2):51-72.
Relevant Robinson's arithmetic.J. Michael Dunn - 1979 - Studia Logica 38 (4):407 - 418.
Substitution in relevant logics.Tore Fjetland Øgaard - 2019 - Review of Symbolic Logic (3):1-26.
Conditionals, quantification, and strong mathematical induction.Daniel H. Cohen - 1991 - Journal of Philosophical Logic 20 (3):315 - 326.

View all 8 citations / Add more citations

References found in this work

Computability and Logic.George Boolos, John Burgess, Richard P. & C. Jeffrey - 1980 - New York: Cambridge University Press. Edited by John P. Burgess & Richard C. Jeffrey.
Foundations of mathematical logic.Haskell Brooks Curry - 1963 - New York: Dover Publications.
Completeness Theorems for the Systems E of Entailment and EQ of Entailment with Quantification.Alan Ross Anderson - 1960 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 6 (7-14):201-216.

View all 9 references / Add more references