Solomon Feferman--Papers in PDF Format

(Caveat lector: published versions of the following may contain some changes.)

  1. Finitary inductively presented logics, in Logic Colloquium '88 (R. Ferro, et al., eds.), North-Holland, Amsterdam (1989) 191-220.
  2. The development of programs for the foundations of mathematics in the first third of the 20th century. (1993). To appear in Storia del XX secolo: Logica, Istituto della Enciclopedia Italiana, Rome.
  3. What rests on what? The proof-theoretic analysis of mathematics, in Philosophy of Mathematics Part I (J. Czermak, ed.) Proc. of the 15th International Wittgenstein Symposium, Verlag Hölder-Pichler-Tempsky, Vienna (1993) 141-171; reprinted as Ch. 10 in In the Light of Logic, Oxford Univ. Press, New York (1998) 187-208.
  4. Why a little bit goes a long way: Logical foundations of scientifically applicable mathematics, in PSA 1992, Vol. II, 442-455, 1993. Reprinted as Chapter 14 in In the Light of Logic, 284-298.
  5. Predicative foundations of arithmetic (with G. Hellman), J. Philosophical Logic 24 (1995) 1-17.
  6. Godel's Dialectica interpretation and its two-way stretch, in Computational Logic and Proof Theory (G. Gottlob, et al., eds.), Lecture Notes in Computer Science 713 (1993) 23-40; reprinted as Ch. 11 in In the Light of Logic, 209-225.
  7. Kreisel's "unwinding" program, in Kreiseliana (P. Odifreddi, ed.), A. K. Peters Ltd., Wellesley (1996) 247-273.
  8. Deciding the Undecidable: Wrestling with Hilbert's Problems, Inaugural address, Stanford Univ., May 13, 1994, published as Ch. 1 in In the Light of Logic, 3-27.
  9. Penrose's Gödelian argument, PSYCHE 2 (1996) 21-32.
  10. Definedness, Erkenntnis 43 (1995) 295-320.
  11. Computation on abstract data types. The extensional approach, with an application to streams, Annals of Pure and Applied Logic 81 (1996) 75-113.
  12. Proof Theory Since 1960, prepared for the Encyclopedia of Philosophy Supplement, Macmillan Publishing Co., New York.
  13. Gödel's program for new axioms: Why, where, how and what?, in Gödel '96 (P. Hajek, ed.), Lecture Notes in Logic 6 (1996), 3-22.
  14. Challenges to predicative foundations of arithmetic (with G. Hellman), in Between Logic and Intuition. Essays in Honor of Charles Parsons (G. Sher and R. Tieszen, eds.), Cambridge Univ. Press, Cambridge (2000) 317-338.
  15. The unfolding of non-finitist arithmetic (with T. Strahm), Annals of Pure and Applied Logic 104 (2000) 75-96.
  16. Does mathematics need new axioms?, American Mathematical Monthly 106 (1999) 99-111.
  17. My route to arithmetization, Theoria 63 (1997) 168-181.
  18. Godel's Functional ("Dialectica") Interpretation (with J. Avigad), in The Handbook of Proof Theory (S. Buss, ed.), North-Holland Pub. Co., Amsterdam (1998) 337-405.
  19. Three conceptual problems that bug me, Unpublished lecture text for 7th Scandinavian Logic Symposium, Uppsala, 1996.
  20. Highlights in Proof Theory, in Proof Theory (V. F. Hendricks, et al., eds.) Kluwer Academic Publishers, Dordrecht (2000) 11-31.
  21. The significance of Hermann Weyl's Das Kontinuum, ibid., 179-194.
  22. Relationships between Constructive, Predicative and Classical Systems of Analysis, ibid., 221-236.
  23. Mathematical Intuition vs. Mathematical Monsters, Synthese 125 (2000) 317-332.
  24. Ah, Chu, in JFAK. Essays Dedicated to Johan van Benthem on the Occasion of his Fiftieth Birthday, Amsterdam Univ. Press, Amsterdam (1999), CD-ROM only.
  25. Logic, Logics, and Logicism, Notre Dame J. of Formal Logic 40 (1999) 31-54.
  26. Does reductive proof theory have a viable rationale?, Erkenntnis 53 (2000) 63-96.
  27. Alfred Tarski and a watershed meeting in logic: Cornell, 1957 , in (J. Hintikka, et al., eds.) Philosophy and Logic. In search of the Polish tradition, Synthese Library vol. 323, Kluwer Acad. Pubs. (2003), 151-162.
  28. Does mathematics need new axioms?, (Proceedings of a symposium with H. M. Friedman, P. Maddy and J. Steel, Bulletin of Symbolic Logic 6 (2000) 401-413.
  29. Tarski's conception of logic, Annals of Pure and Applied Logic 126 (2004) 5-13.
  30. Tarski's conceptual analysis of semantical notions, Sémantique et épistémologie (A. Benmakhlouf, ed.) Editions Le Fennec, Casablanca (2004) [distrib. J. Vrin, Paris] 79-108.
  31. Notes on Operational Set Theory I. Generalization of "small" large cardinals in classical and admissible set theory, draft (Theorem 4(i), p. 5, needs correction).
  32. Predicativity. In The Oxford Handbook of Philosophy of Mathematics and Logic (S. Shapiro, ed.), Oxford University Press, Oxford (2005) 590-624.
  33. Typical ambiguity. Trying to have your cake and eat it too. One Hundred Years of Russell's Paradox (G. Link, ed.), Walter de Gruyter, Berlin (2004) 135-151.
  34. Some formal systems for the unlimited theory of functors and categories. Unpublished MS from 1972-73 referred to in the preceding paper, sec. 8. Uneven scanning has resulted in some missing symbols that can be restored according to context, including: p. 18, l.6, S*; p.19, Theorem 3.1, S*, and p.26, l.3, a epsilon* b.
  35. What kind of logic is "Independence Friendly" logic?, to appear in The Philosophy of Jaakko Hintikka (Randall E. Auxier and Lewis Edwin Hahn, eds.); Volume 30 in the Library of Living Philosophers.
  36. Comments on "Predicativity as a philosophical position" by G. Hellman, Review Internationale de Philosophie (special issue, Russell en héritage. Le centenaire des Principles, Ph. de Rouilhan, ed.) 229 (no. 3, 2004), 313-323.
  37. The Gödel editorial project: a synopsis Bull. Symbolic Logic 11 (2005) 132-149.
  38. Enriched stratified systems for the foundations of category theory, to appear in What is Category Theory? (G. Sica, ed.), Polimetrica, Milano.