-
1Constructive ReasoningIn B. van Rootselaar & Frits Staal (eds.), Logic, methodology and philosophy of science III, North-holland Pub. Co.. pp. 185-99. 1968.
-
18Frege versus Cantor and Dedekind: On the Concept of NumberIn Matthias Schirn (ed.), Frege: Importance and Legacy, De Gruyter. pp. 70-113. 1996.
-
50What Hilbert and Bernays Meant by “Finitism”In Gabriele M. Mras, Paul Weingartner & Bernhard Ritter (eds.), Philosophy of Logic and Mathematics: Proceedings of the 41st International Ludwig Wittgenstein Symposium, De Gruyter. pp. 249-262. 2018.“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
-
222Gödel on intuition and on Hilbert's finitismIn 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
-
203Review: J. P. Mayberry, The Foundations of Mathematics in the Theory of Sets (review)Bulletin of Symbolic Logic 8 (3): 424-426. 2002.
-
48Chicago 1967 meeting of the Association for Symbolic LogicJournal of Symbolic Logic 36 (2): 359-368. 1971.
-
364The myth of the mindTopoi 21 (1): 65-74. 2002.Of course, I do not mean by the title of this paper to deny the existence of something called
-
200Against intuitionism: Constructive mathematics is part of classical mathematicsJournal of Philosophical Logic 12 (2). 1983.
-
136Meeting of the Association for Symbolic Logic, Chicago, 1977Journal of Symbolic Logic 43 (3): 614-619. 1978.
-
80Plato's Second Best MethodReview 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
-
155Kant and FinitismJournal 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
-
197There 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
-
84The five questionsIn 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
-
93Early Analytic Philosophy: Frege, Russell, Wittgenstein : Essays in Honor of Leonard Linsky (edited book)Open Court. 1996.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.
-
78Review: H. G. Rice, On Completely Recursively Enumerable Classes and Their Key Arrays (review)Journal of Symbolic Logic 23 (1): 48-48. 1958.
-
76The Hilton New York Hotel New York, NY December 27–29, 2005Bulletin of Symbolic Logic 12 (3). 2006.
-
339Gödel's reformulation of Gentzen's first consistency proof for arithmetic: The no-counterexample interpretationBulletin of Symbolic Logic 11 (2): 225-238. 2005.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.
-
45Extensional Equality in the Classical Theory of TypesVienna 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
-
74William Tait is one of the most distinguished philosophers of mathematics of the last fifty years. This volume collects his most important published philosophical papers from the 1980's to the present. The articles cover a wide range of issues in the foundations and philosophy of mathematics, including some on historical figures ranging from Plato to Gödel.
-
46A Nonconstructive Proof of Gentzen's Hauptsatz for Second Order Predicate LogicJournal of Symbolic Logic 33 (2): 289-290. 1968.
-
308The completeness of Heyting first-order logicJournal of Symbolic Logic 68 (3): 751-763. 2003.Restricted to first-order formulas, the rules of inference in the Curry-Howard type theory are equivalent to those of first-order predicate logic as formalized by Heyting, with one exception: ∃-elimination in the Curry-Howard theory, where ∃x : A.F (x) is understood as disjoint union, are the projections, and these do not preserve firstorderedness. This note shows, however, that the Curry-Howard theory is conservative over Heyting’s system.
-
235Proof-theoretic Semantics for Classical MathematicsSynthese 148 (3): 603-622. 2006.We discuss the semantical categories of base and object implicit in the Curry-Howard theory of types and we derive derive logic and, in particular, the comprehension principle in the classical version of the theory. Two results that apply to both the classical and the constructive theory are discussed. First, compositional semantics for the theory does not demand ‘incomplete objects’ in the sense of Frege: bound variables are in principle eliminable. Secondly, the relation of extensional equalit…Read more
-
98Kurt Godel. Collected Works. Volume IV: Selected Correspondence AG; Volume V: Selected Correspondence HZPhilosophia Mathematica 14 (1): 76. 2006.
-
260Gödel's Correspondence on Proof Theory and Constructive Mathematics †Charles Parsons read part of an early draft of this review and made important corrections and suggestionsPhilosophia Mathematica 14 (1): 76-111. 2006.
-
4Zermelo's Conception of Set Theory and Reflection PrinciplesIn Matthias Schirn (ed.), The Philosophy of Mathematics Today, Clarendon Press. 2003.
Chicago, Illinois, United States of America