(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.
I’m Greg Restall, and this is my personal website. I teach philosophy and logic as Professor of Philosophy at the University of Melbourne. ¶ Start at the home page of this site—a compendium of recent additions around here—and go from there to learn more about who I am and what I do. ¶ This is my personal site on the web. Nothing here is in any way endorsed by the University of Melbourne.