•  1
    Constructive Reasoning
    In B. van Rootselaar & Frits Staal (eds.), Logic, methodology and philosophy of science III, North-holland Pub. Co.. pp. 185-99. 1968.
  •  50
    “Finitism” (Tait 1981) presents an argument that finitist number theory is primitive recursive arithmetic (PRA). The argument is based on taking seriously the “finite” in “finitism”. But the question remained: what did Hilbert (and Bernays) mean in the early 1920’s through the early 1930’s by “finitism” and in particular, did they restrict finitist number theory to PRA. In his dissertation (Zach 2003), Richard Zach pointed out that Hilbert endorsed results as finitist that require more than PRA …Read more
  •  80
    The reduction of the lambda calculus to the theory of combinators in [Sch¨ onfinkel, 1924] applies to positive implicational logic, i.e. to the typed lambda calculus, where the types are built up from atomic types by means of the operation A −→ B, to show that the lambda operator can be eliminated in favor of combinators K and S of each type A −→ (B −→ A) and (A −→ (B −→ C)) −→ ((A −→ B) −→ (A −→ C)), respectively.1 I will extend that result to the case in which the types are built up by means o…Read more
  •  246
    Beyond the axioms: The question of objectivity in mathematics
    Philosophia Mathematica 9 (1): 21-36. 2001.
    This paper contains a defense against anti-realism in mathematics in the light both of incompleteness and of the fact that mathematics is a ‘cultural artifact.’. Anti-realism (here) is the view that theorems, say, of aritltmetic cannot be taken at face value to express true propositions about the system of numbers but must be reconstrued to be about somctliiiig else or about nothing at all. A ‘bite-the-bullet’ aspect of the defease is that, adopting new axioms, liitherto independent, is not. a m…Read more
  •  83
    Finite Definability of Number-Theoretic Functions and Parametric Completeness of Equational Calculi
    with Georg Kreisel
    Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 7 (1-5): 28-38. 1961.
  •  222
    Gödel on intuition and on Hilbert's finitism
    In Kurt Gödel, Solomon Feferman, Charles Parsons & Stephen G. Simpson (eds.), Kurt Gödel: essays for his centennial, Association For Symbolic Logic. 2010.
    There are some puzzles about G¨ odel’s published and unpublished remarks concerning finitism that have led some commentators to believe that his conception of it was unstable, that he oscillated back and forth between different accounts of it. I want to discuss these puzzles and argue that, on the contrary, G¨ odel’s writings represent a smooth evolution, with just one rather small double-reversal, of his view of finitism. He used the term “finit” (in German) or “finitary” or “finitistic” primar…Read more
  •  48
    Chicago 1967 meeting of the Association for Symbolic Logic
    Journal of Symbolic Logic 36 (2): 359-368. 1971.
  •  364
    The myth of the mind
    Topoi 21 (1): 65-74. 2002.
    Of course, I do not mean by the title of this paper to deny the existence of something called
  •  80
    Plato's Second Best Method
    Review of Metaphysics 39 (3). 1986.
    AT PHAEDO 96A-C Plato portrays Socrates as describing his past study of "the kind of wisdom known as περὶ φυσέως ἱστορία." At 96c-97b, Socrates says that this study led him to realize that he had an inadequate understanding of certain basic concepts which it involved. In consequence, he says at 97b, he abandoned this method and turned to a method of his own. But at this point in the dialogue, instead of proceeding immediately to describe his method, Plato has him interjecting a complaint concern…Read more
  •  136
    Meeting of the Association for Symbolic Logic, Chicago, 1977
    with Carl G. Jockusch, Robert I. Soare, and Gaisi Takeuti
    Journal of Symbolic Logic 43 (3): 614-619. 1978.
  •  155
    Kant and Finitism
    Journal of Philosophy 113 (5/6): 261-273. 2016.
    An observation and a thesis: The observation is that, whatever the connection between Kant’s philosophy and Hilbert’s conception of finitism, Kant’s account of geometric reasoning shares an essential idea with the account of finitist number theory in “Finitism”, namely the idea of constructions f from ‘arbitrary’ or ‘generic’ objects of various types. The thesis is that, contrary to a substantial part of contemporary literature on the subject, when Kant referred to number and arithmetic, he was …Read more
  •  197
    There can be no doubt about the value of Frege's contributions to the philosophy of mathematics. First, he invented quantification theory and this was the first step toward making precise the notion of a purely logical deduction. Secondly, he was the first to publish a logical analysis of the ancestral R* of a relation R, which yields a definition of R* in second-order logic.1 Only a narrow and arid conception of philosophy would exclude these two achievements. Thirdly and very importantly, the …Read more
  •  84
    The five questions
    In V. F. Hendricks & Hannes Leitgeb (eds.), Philosophy of Mathematics: Five Questions, Automatic Press/vip. 2007.
    1. A Road to Philosophy of Mathematics l became interested in philosophy and mathematics at more or less the same time, rather late in high school; and my interest in the former certainly influenced my attitude towards the latter, leading me to ask what mathematics is really about at a fairly early stage. I don ’t really remember how it was that I got interested in either subject. A very good math teacher came to my school when I was in 9th grade and I got caught up in his course on solid geomet…Read more
  •  93
    These essays present new analyses of the central figures of analytic philosophy -- Frege, Russell, Moore, Wittgenstein, and Carnap -- from the beginnings of the analytic movement into the 1930s. The papers do not reflect a single perspective, but rather express divergent interpretations of this controversial intellectual milieu.
  •  54
    Nested Recursion
    Journal of Symbolic Logic 28 (1): 103-104. 1963.
  •  339
    The last section of “Lecture at Zilsel’s” [9, §4] contains an interesting but quite condensed discussion of Gentzen’s first version of his consistency proof for P A [8], reformulating it as what has come to be called the no-counterexample interpretation. I will describe Gentzen’s result (in game-theoretic terms), fill in the details (with some corrections) of Godel's reformulation, and discuss the relation between the two proofs.
  •  45
    Extensional Equality in the Classical Theory of Types
    Vienna Circle Institute Yearbook 3 219-234. 1995.
    The classical theory of types in question is essentially the theory of Martin-Löf [1] but with the law of double negation elimination. I am ultimately interested in the theory of types as a framework for the foundations of mathematics and, for this purpose, we need to consider extensions of the theory obtained by adding ‘well-ordered types,’ for example the type N of the finite ordinals; but the unextended theory will suffice to illustrate the treatment of extensional equality