•  1590
    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
  •  111
    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.
  •  1062
    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.
  •  131
    Critical study of Michael Potter’s Reason’s Nearest Kin (review)
    Notre Dame Journal of Formal Logic 46 (4): 503-513. 2005.
    Critical study of Michael Potter, Reason's Nearest Kin. Philosophies of Arithmetic from Kant to Carnap. Oxford University Press, Oxford, 2000. x + 305 pages
  •  197
    The Epsilon Calculus
    In Ed Zalta (ed.), Stanford Encyclopedia of Philosophy, Stanford Encyclopedia of Philosophy. 2012.
    The epsilon calculus is a logical formalism developed by David Hilbert in the service of his program in the foundations of mathematics. The epsilon operator is a term-forming operator which replaces quantifiers in ordinary predicate logic. Specifically, in the calculus, a term εx A denotes some x satisfying A(x), if there is one. In Hilbert's Program, the epsilon terms play the role of ideal elements; the aim of Hilbert's finitistic consistency proofs is to give a procedure which removes such te…Read more