•  214
    Purity of Methods
    with Michael Detlefsen
    Philosophers' Imprint 11. 2011.
    Throughout history, mathematicians have expressed preference for solutions to problems that avoid introducing concepts that are in one sense or another “foreign” or “alien” to the problem under investigation. This preference for “purity” (which German writers commonly referred to as “methoden Reinheit”) has taken various forms. It has also been persistent. This notwithstanding, it has not been analyzed at even a basic philosophical level. In this paper we give a basic analysis of one conception …Read more
  •  427
    Over the years many mathematicians have voiced a preference for proofs that stay “close” to the statements being proved, avoiding “foreign”, “extraneous”, or “remote” considerations. Such proofs have come to be known as “pure”. Purity issues have arisen repeatedly in the practice of arithmetic; a famous instance is the question of complex-analytic considerations in the proof of the prime number theorem. This article surveys several such issues, and discusses ways in which logical considerations …Read more
  •  76
    Arithmetical independence results using higher recursion theory
    Journal of Symbolic Logic 69 (1): 1-8. 2004.
    We extend an independence result proved in our earlier paper "Solovay's Theorem Cannot Be Simplified" (Annals of Pure and Applied Logic 112 (2001)). Our method uses the Barwise.