-
Constructive ReasoningIn B. van Rootselaar & Frits Staal (eds.), Logic, methodology and philosophy of science III, North-holland Pub. Co.. pp. 185-99. 1968.
-
14J. P. Mayberry. The foundations of mathematics in the theory of sets. Encyclopedia of mathematics and its applications, vol. 82. Cambridge University Press, Cambridge 2000, New York 2001, etc., xx + 424 pp (review)Bulletin of Symbolic Logic 8 (3): 424-426. 2002.
-
Frege versus Cantor and Dedekind: On the Concept of NumberIn Matthias Schirn (ed.), Frege: importance and legacy, Walter De Gruyter. pp. 70-113. 1996.
-
1What Hilbert and Bernays Meant by "Finitism"In Gabriele Mras, Paul Weingartner & Bernhard Ritter (eds.), Philosophy of Logic and Mathematics: Proceedings of the 41st International Ludwig Wittgenstein Symposium, De Gruyter. pp. 249-261. 2019.
-
34Plato'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
-
26Kurt Godel. Collected Works. Volume IV: Selected Correspondence AG; Volume V: Selected Correspondence HZPhilosophia Mathematica 14 (1): 76. 2006.
-
63Curtis Franks The Autonomy of Mathematical Knowledge: Hilbert's Program RevisitedHistory and Philosophy of Logic 32 (2). 2011.History and Philosophy of Logic, Volume 32, Issue 2, Page 177-183, May 2011
-
To appear in the Proceedings of Logic Colloquium 2006. (28 pages).
-
30The Palmer House Hilton Hotel, Chicago, Illinois April 19–21, 2007Bulletin of Symbolic Logic 13 (4). 2007.
-
14Review: H. G. Rice, On Completely Recursively Enumerable Classes and Their Key Arrays (review)Journal of Symbolic Logic 23 (1): 48-48. 1958.
-
132Intensional interpretations of functionals of finite type IJournal of Symbolic Logic 32 (2): 198-212. 1967.
-
74The law of excluded middle and the axiom of choiceIn Alexander George (ed.), Mathematics and mind, Oxford University Press. pp. 45--70. 1994.
-
82Some recent essays in the history of the philosophy of mathematics: A critical review (review)Synthese 96 (2). 1993.
-
45Meeting of the association for symbolic logic: Biloxi, 1979Journal of Symbolic Logic 46 (1): 191-198. 1981.
-
47Proof-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
-
17Kleene S. C.. Extension of an effectively generated class of functions by enumeration. Colloquium mathematicum, vol. 6 , pp. 68–78 (review)Journal of Symbolic Logic 25 (3): 279-280. 1960.
-
38The 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
-
71Godel's interpretation of intuitionismPhilosophia Mathematica 14 (2): 208-228. 2006.Gödel regarded the Dialectica interpretation as giving constructive content to intuitionism, which otherwise failed to meet reasonable conditions of constructivity. He founded his theory of primitive recursive functions, in which the interpretation is given, on the concept of computable function of finite type. I will (1) criticize this foundation, (2) propose a quite different one, and (3) note that essentially the latter foundation also underlies the Curry-Howard type theory, and hence Heyting…Read more
-
85Foundations of a General Theory of Manifolds [Cantor, 1883], which I will refer to as the Grundlagen, is Cantor’s first work on the general theory of sets. It was a separate printing, with a preface and some footnotes added, of the fifth in a series of six papers under the title of “On infinite linear point manifolds”. I want to briefly describe some of the achievements of this great work. But at the same time, I want to discuss its connection with the so-called paradoxes in set theory. There se…Read more
-
48A counterexample to a conjecture of Scott and SuppesJournal of Symbolic Logic 24 (1): 15-16. 1959.
-
92The background of these remarks is that in 1967, in ‘’Constructive reasoning” [27], I sketched an argument that finitist arithmetic coincides with primitive recursive arithmetic, P RA; and in 1981, in “Finitism” [28], I expanded on the argument. But some recent discussions and some of the more recent literature on the subject lead me to think that a few further remarks would be useful.
Chicago, Illinois, United States of America