'Strenge' Arithmetics

March 2002

(with Robert K. Meyer) “ ‘Strenge’ Arithmetics,” Logique et Analyse 42 (1999) 205–220 (published in 2002).

We consider the virtues of relevant arithmetic couched in the logic E of entailment as opposed to R of relevant implication. The move to a stronger logic allows us to construct a complete system of true arithmetic, in which whenever an entailment A → B is not true (an example: 0=2 → 0=1 is not provable) then its negation ~(A → B) is true.

 download pdf

You are welcome to download and read this document. I welcome feedback on it. Please check the final published version if you wish to cite it. Thanks.


I’m Greg Restall, and this is my personal website. I am the Shelby Cullom Davis Professor of Philosophy at the University of St Andrews, and the Director of the Arché Philosophical Research Centre for Logic, Language, Metaphysics and Epistemology I like thinking about – and helping other people think about – logic and philosophy and the many different ways they can inform each other.


To receive updates from this site, subscribe to the RSS feed in your feed reader. Alternatively, follow me at  @consequently@hcommons.social, where most updates are posted.


This site is powered by Netlify, GitHub, Hugo, Bootstrap, and coffee.   ¶   © 1992– Greg Restall.