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

 download pdf

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.

Do you like this, or do you have a comment? Then please  share or reply on Twitter, or  email me.

← Carnap’s Tolerance, Meaning and Logical Pluralism | Writing Archive | Logic →


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.



To receive updates from this site, you can subscribe to the  RSS feed of all updates to the site in an RSS feed reader, or follow me on Twitter at  @consequently, where I’ll update you if anything is posted.