Hostname: page-component-5cf477f64f-mgq6s Total loading time: 0 Render date: 2025-04-03T15:01:28.974Z Has data issue: false hasContentIssue false
  • English
  • Français

IN MEMORIAM: SOLOMON FEFERMAN (1928–2016)

Published online by Cambridge University Press:  04 December 2017

Charles Parsons  and
Wilfried Sieg
Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content so a preview has been provided. As you have access to this content, a full PDF is available via the ‘Save PDF’ action button.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
In Memoriam
Information
Bulletin of Symbolic Logic , Volume 23 , Issue 3 , September 2017 , pp. 337 - 344
Copyright
Copyright © The Association for Symbolic Logic 2017 

References

Writings of Solomon Feferman

1955. Review of Wang [1951]. The Journal of Symbolic Logic, vol. 20, pp. 76–77.Google Scholar
1959. (With R. L. Vaught.) The first-order properties of algebraic systems . Fundamenta Mathematicae, vol. 47, pp. 57–103.CrossRefGoogle Scholar
1960. Arithmetization of metamathematics in a general setting . Fundamenta Mathematicae, vol. 49, pp. 35–92.Google Scholar
1962. Transfinite recursive progressions of axiomatic theories . The Journal of Symbolic Logic, vol. 27, pp. 259–316.Google Scholar
1964. Systems of predicative analysis . The Journal of Symbolic Logic, vol. 29, pp. 1–30.Google Scholar
1965. Some applications of the notion of forcing and generic sets . Fundamenta Mathematicae, vol. 56, pp. 325–345.Google Scholar
1968. Autonomous transfinite progressions and the extent of predicative mathematics , Logic, Methodology, and Philosophy of Science III (van Rootselaar, B. and Staal, J. F., editors), North-Holland, Amsterdam, pp. 121–135.Google Scholar
1970. Formal theories for transfinite iterations of generalized inductive definitions and some subsystems of analysis (Myhill, Kino, and Vesley, editors), pp. 303–326.Google Scholar
1975. A language and axioms for explicit mathematics , Algebra and Logic (Crossley, J. N., editor), Lecture Notes in Mathematics, vol. 450, Springer, Berlin, pp. 87–139.Google Scholar
1981. (With Wilfried Buchholz, Wolfram Pohlers, and Wilfried Sieg.) Iterated Inductive Definitions and Subsystems of Analysis, Lecture Notes in Mathematics, vol. 897, Springer, Berlin.Google Scholar
1988. Weyl vindicated: Das Kontinuum seventy years later , Temi e prospettivi della logica e della scienza contemporanee, vol. 1 (Celluci, C. and Sambin, G., editors), CLUEB, Bologna, pp. 59–93, Reprinted in [1998].Google Scholar
1988a. Hilbert’s program relativized: Proof-theoretical and foundational reductions . The Journal of Symbolic Logic, vol. 53, pp. 364–384.Google Scholar
1993. Why a little bit goes a long way: Logical foundations of scientifically applicable mathematics , PSA 1992, vol. 2, Philosophy of Science Association, East Lansing, MI, pp. 447–455, Reprinted in [1998].Google Scholar
1998. In the Light of Logic, Oxford University Press, New York.Google Scholar
2004. (With Anita Burdman Feferman.) Alfred Tarski: Life and Logic, Cambridge University Press.Google Scholar
2005. The Gödel editorial project: A synopsis, this Bulletin, vol. 11, pp. 132–149.CrossRefGoogle Scholar
2008. Philosophy of Mathematics: Five Questions (Hendricks, V. and Leitgeb, H., editors), Automatic Press/VIP, pp. 115–135.Google Scholar
2009. Conceptions of the continuum . Intellectica, vol. 51, pp. 169–189.Google Scholar
2014. A fortuitous year with Leon Henkin , The Life and Work of Leon Henkin (Manzano, M., Sain, I., and Alonso, E., editors), Birkhäuser, Basel, pp. 35–40.Google Scholar
2016. Parsons and I: Sympathies and differences . The Journal of Philosophy, vol. 113, pp. 234–246.CrossRefGoogle Scholar
2016a. The operational perspective: Three routes , Advances in Proof Theory (Kahle, R., Strahm, T., and Studer, T., editors), Birkhäuser, Basel, pp. 269–289.Google Scholar
2017. Autobiography. In Jäger and Sieg [2017].Google Scholar
Forthcoming. The Continuum Hypothesis is neither a definite mathematical problem nor a definite logical problem , Exploring the Frontiers of Incompleteness (Koellner, P., editor).Google Scholar
Bishop, E., 1967. Foundations of constructive analysis. McGraw-Hill, New York.Google Scholar
Friedman, H., 1970. Iterated inductive definitions and $\sum\nolimits_{}^1 {_2 } $ -AC. In Myhill, Kino, and Vesley 1970, pp. 435–442.Google Scholar
Jäger, G., and Sieg, W. (eds.), 2017. Feferman on Foundations: Logic, Mathematics, Philosophy. Springer, Dordrecht.Google Scholar
Myhill, J., Kino, A., and Vesley, R. E. (eds.), 1970. Intuitionism and Proof Theory. North-Holland, Amsterdam.Google Scholar
Searle, J. R., 1995. The Construction of Social Reality. Free Press/Macmillan, New York.Google Scholar
Turing, A. M., 1939. Systems of logic based on ordinals. Proceedings of the London Mathematical Society (2), vol. 45, pp. 161–228.Google Scholar
Wang, H., 1951. Arithmetic models of formal systems. Methodos 3, pp. 217–232.Google Scholar
Bishop, E., 1967. Foundations of constructive analysis. McGraw-Hill, New York.Google Scholar
Friedman, H., 1970. Iterated inductive definitions and $\sum\nolimits_{}^1 {_2 } $ -AC. In Myhill, Kino, and Vesley 1970, pp. 435–442.Google Scholar
Jäger, G., and Sieg, W. (eds.), 2017. Feferman on Foundations: Logic, Mathematics, Philosophy. Springer, Dordrecht.Google Scholar
Myhill, J., Kino, A., and Vesley, R. E. (eds.), 1970. Intuitionism and Proof Theory. North-Holland, Amsterdam.Google Scholar
Searle, J. R., 1995. The Construction of Social Reality. Free Press/Macmillan, New York.Google Scholar
Turing, A. M., 1939. Systems of logic based on ordinals. Proceedings of the London Mathematical Society (2), vol. 45, pp. 161–228.Google Scholar
Wang, H., 1951. Arithmetic models of formal systems. Methodos 3, pp. 217–232.Google Scholar