•  53
    Mathematical methods in philosophy: Editors' introduction
    Review of Symbolic Logic 1 (2): 143-145. 2008.
    Mathematics and philosophy have historically enjoyed a mutually beneficial and productive relationship, as a brief review of the work of mathematician–philosophers such as Descartes, Leibniz, Bolzano, Dedekind, Frege, Brouwer, Hilbert, Gödel, and Weyl easily confirms. In the last century, it was especially mathematical logic and research in the foundations of mathematics which, to a significant extent, have been driven by philosophical motivations and carried out by technically minded philosophe…Read more
  •  145
    Hilbert’s Program
    In Edward N. Zalta (ed.), The Stanford Encyclopedia of Philosophy, The Metaphysics Research Lab. 2014.
    In the early 1920s, the German mathematician David Hilbert (1862–1943) put forward a new proposal for the foundation of classical mathematics which has come to be known as Hilbert's Program. It calls for a formalization of all of mathematics in axiomatic form, together with a proof that this axiomatization of mathematics is consistent. The consistency proof itself was to be carried out using only what Hilbert called “finitary” methods. The special epistemological character of finitary reasoning …Read more
  •  733
    Vagueness, Logic and Use: Four Experimental Studies on Vagueness
    with Phil Serchuk and Ian Hargreaves
    Mind and Language 26 (5): 540-573. 2011.
    Although arguments for and against competing theories of vagueness often appeal to claims about the use of vague predicates by ordinary speakers, such claims are rarely tested. An exception is Bonini et al. (1999), who report empirical results on the use of vague predicates by Italian speakers, and take the results to count in favor of epistemicism. Yet several methodological difficulties mar their experiments; we outline these problems and devise revised experiments that do not show the same re…Read more
  •  49
    Note on generalizing theorems in algebraically closed fields
    Archive for Mathematical Logic 37 (5-6): 297-307. 1998.
    The generalization properties of algebraically closed fields $ACF_p$ of characteristic $p > 0$ and $ACF_0$ of characteristic 0 are investigated in the sequent calculus with blocks of quantifiers. It is shown that $ACF_p$ admits finite term bases, and $ACF_0$ admits term bases with primality constraints. From these results the analogs of Kreisel's Conjecture for these theories follow: If for some $k$ , $A(1 + \cdots + 1)$ ( $n$ 1's) is provable in $k$ steps, then $(\forall x)A(x)$ is provable
  •  346
    Computability. Computable functions, logic, and the foundations of mathematics (review)
    History and Philosophy of Logic 23 (1): 67-69. 2002.
    Epstein and Carnielli's fine textbook on logic and computability is now in its second edition. The readers of this journal might be particularly interested in the timeline `Computability and Undecidability' added in this edition, and the included wall-poster of the same title. The text itself, however, has some aspects which are worth commenting on.