David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
Journal of Symbolic Logic 57 (3):824-831 (1992)
Based on the relevant logic R, the system R# was proposed as a relevant Peano arithmetic. R# has many nice properties: the most conspicuous theorems of classical Peano arithmetic PA are readily provable therein; it is readily and effectively shown to be nontrivial; it incorporates both intuitionist and classical proof methods. But it is shown here that R# is properly weaker than PA, in the sense that there is a strictly positive theorem QRF of PA which is unprovable in R#. The reason is interesting: if PA is slightly weakened to a subtheory P+, it admits the complex ring C as a model; thus QRF is chosen to be a theorem of PA but false in C. Inasmuch as all strictly positive theorems of R# are already theorems of P+, this nonconservativity result shows that QRF is also a nontheorem of R#. As a consequence, Ackermann's rule γ is inadmissible in R#. Accordingly, an extension of R# which retains its good features is desired. The system R##, got by adding an omega-rule, is such an extension. Central question: is there an effectively axiomatizable system intermediate between R# and R##, which does formalize arithmetic on relevant principles, but also admits γ in a natural way?
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library|
References found in this work BETA
No references found.
Citations of this work BETA
Edwin Mares (2012). Relevant Logic and the Philosophy of Mathematics. Philosophy Compass 7 (7):481-494.
Similar books and articles
George Mills (1978). A Model of Peano Arithmetic with No Elementary End Extension. Journal of Symbolic Logic 43 (3):563-567.
C. Ward Henson, Matt Kaufmann & H. Jerome Keisler (1984). The Strength of Nonstandard Methods in Arithmetic. Journal of Symbolic Logic 49 (4):1039-1058.
J. Michael Dunn (1980). Quantum Mathematics. PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1980:512 - 531.
J. Michael Dunn (1979). Relevant Robinson's Arithmetic. Studia Logica 38 (4):407 - 418.
Robert K. Meyer (1998). ⊃E is Admissible in “True” Relevant Arithmetic. Journal of Philosophical Logic 27 (4):327 - 351.
Robert K. Meyer (1998). ÂE is Admissible in ÂTrueâ Relevant Arithmetic. Journal of Philosophical Logic 27 (4):327-351.
Added to index2009-01-28
Total downloads10 ( #157,223 of 1,168,985 )
Recent downloads (6 months)1 ( #140,419 of 1,168,985 )
How can I increase my downloads?