Solomon Feferman
#1,484
Most Influential Person Now
American philosopher and mathematician
Solomon Feferman's AcademicInfluence.com Rankings
Solomon Fefermanphilosophy Degrees
Philosophy
#160
World Rank
#404
Historical Rank
#69
USA Rank
Logic
#32
World Rank
#102
Historical Rank
#14
USA Rank
Download Badge
Philosophy Mathematics
Solomon Feferman's Degrees
- PhD Mathematics Princeton University
Why Is Solomon Feferman Influential?
(Suggest an Edit or Addition)According to Wikipedia, Solomon Feferman was an American philosopher and mathematician who worked in mathematical logic. In addition to his prolific technical work in proof theory, recursion theory, and set theory, he was known for his contributions to the history of logic and as a vocal proponent of the philosophy of mathematics known as predicativism, notably from an anti-platonist stance.
Solomon Feferman's Published Works
Published Works
- The first order properties of products of algebraic systems (1959) (444)
- Arithmetization of metamathematics in a general setting (1959) (417)
- Toward useful type-free theories. I (1984) (332)
- A Language and Axioms for Explicit Mathematics (1975) (326)
- Constructive Theories of Functions and Classes (1979) (302)
- Systems of predicative analysis (1964) (297)
- Transfinite recursive progressions of axiomatic theories (1962) (283)
- Reflecting on incompleteness (1991) (224)
- Kurt Gödel : collected works (1986) (187)
- Chapter V – Gödel’s Functional (“Dialectica”) Interpretation (1998) (183)
- Some applications of the notions of forcing and generic sets (1964) (183)
- Theories of Finite Type Related to Mathematical Practice (1977) (151)
- Hilbert's program relativized; Proof-theoretical and foundational reductions (1988) (116)
- Categorical Foundations and Foundations of Category Theory (1977) (116)
- Systems of predicative analysis, II: Representations of ordinals (1968) (104)
- Formal Theories for Transfinite Iterations of Generalized Inductive Definitions and Some Subsystems of Analysis (1970) (101)
- DOES MATHEMATICS NEED NEW AXIOMS (1999) (96)
- Iterated Inductive Fixed-Point Theories: Application to Hancock's Conjecture (1982) (96)
- Logic, Logics, and Logicism (1999) (88)
- Alfred Tarski: Life and Logic (2004) (85)
- Systems of Explicit Mathematics with Non-Constructive µ-Operator, Part I (1993) (76)
- Incompleteness along paths in progressions of theories (1962) (76)
- Does Mathematics Need New Axioms? (2000) (75)
- Model-Theoretic Logics (2016) (72)
- Collected Works, Volume I, Publications 1929-1936 (1987) (71)
- Why a Little Bit Goes a Long Way: Logical Foundations of Scientifically Applicable Mathematics (1992) (70)
- Finitary inductively presented logics (1994) (62)
- Two notes on abstract model theory. I. Properties invariant on the range of definable relations between structures (1974) (61)
- Predicativity (2007) (61)
- Persistent and invariant formulas for outer extensions (1968) (59)
- Set-Theoretical foundations of category theory (1969) (59)
- Systems of Explicit Mathematics with Non-Constructive µ-Operator, Part II (1996) (59)
- Logics for Termination and Correctness of Functional Programs (1993) (53)
- Gödel's program for new axioms: why, where, how and what? (1996) (52)
- Turing in the land of O(z) (1988) (51)
- Lectures on proof theory (1968) (50)
- The Logic of Mathematical Discovery vs. the Logical Structure of Mathematics (1978) (49)
- Mathematical Intuition Vs. Mathematical Monsters* (2000) (46)
- AXIOMS FOR DETERMINATENESS AND TRUTH (2008) (45)
- Conceptions of the Continuum (2009) (43)
- Degrees of unsolvability associated with classes of formalized theories (1957) (42)
- The unfolding of non-finitist arithmetic (2000) (41)
- Proof theoretic equivalences between classical and constructive theories for analysis (1981) (40)
- Inductive definitions and subsystems of analysis (1981) (40)
- A theory of variable types (1985) (38)
- Polymorphic typed lambda-calculi in a type-free axiomatic framework (1990) (37)
- Predicative foundations of arithmetic (1995) (37)
- Recursion theory and set theory, a marriage of convenience1 (1978) (37)
- Does Reductive Proof Theory Have A Viable Rationale? (2000) (36)
- Persistent and invariant formulas relative to theories of higher order (1966) (36)
- Infinity in Mathematics: Is Cantor Necessary? (1989) (35)
- The Number Systems: Foundations of Algebra and Analysis (2005) (35)
- Are There Absolutely Unsolvable Problems? Gödel's Dichotomy (2006) (35)
- WHAT RESTS ON WHAT? THE PROOF-THEORETIC ANALYSIS OF MATHEMATICS (2002) (34)
- CLASSIFICATIONS OF RECURSIVE FUNCTIONS BY MEANS OF HIERARCHIES( (1962) (34)
- Set-theoretical Invariance Criteria for Logicality (2010) (33)
- Kurt Godel: collected works. Vol. 1: Publications 1929-1936 (1986) (31)
- Lieber Herr Bernays!, Lieber Herr Gödel! Gödel on finitism, constructivity and Hilbert's program (2008) (31)
- Infinitary properties, local functors, and systems of ordinal functions (1972) (30)
- Is the Continuum Hypothesis a definite mathematical problem? DRAFT 9/18/11 For: Exploring the Frontiers of Incompleteness (EFI) Project, Harvard 2011-2012 (2012) (29)
- Inductively Presented Systems and the Formalization of Meta-Mathematics (1982) (29)
- Kreisel’s “unwinding” program (2002) (29)
- Operational set theory and small large cardinals (2009) (29)
- Autonomous Transfinite Progressions and the Extent of Predicative Mathematics (1968) (29)
- Monotone Inductive Definitions (1982) (27)
- Tarski's Conceptual Analysis of Semantical Notions (2008) (26)
- Kurt Gödel : essays for his centennial (2010) (25)
- And so on . . . : reasoning with infinite diagrams (2012) (25)
- A MORE PERSPICUOUS FORMAL SYSTEM FOR PREDICATIVITY (1978) (25)
- Gödel, Nagel, Minds, and Machines (2009) (25)
- Intensionality in mathematics (1985) (25)
- FOUNDATIONS OF UNLIMITED CATEGORY THEORY: WHAT REMAINS TO BE DONE (2012) (22)
- Mechanizing proof theory: resource-aware logics and proof-transformations to extract implicit information (1990) (22)
- The collected works of Julia Robinson (1996) (20)
- Extended Logics: The General Framework (2016) (20)
- Monadic Second-Order Theories (2016) (20)
- What does logic have to tell us about mathematical proofs? (1979) (20)
- Typical Ambiguity: Trying to Have Your Cake and Eat it too (2003) (20)
- Typical Ambiguity: Trying to Have Your Cake and Eat it too (2003) (20)
- What does logic have to tell us about mathematical proofs? (1979) (20)
- Kurt Godel: Conviction and Caution in Philosophy of Science History of Science. (1984) (19)
- Inductive Schemata and Recursively Continuous Functionals (1977) (19)
- Two notes on abstract model theory. II. Languages for which, the set of valid sentences is semi-invariantly implicitly definable (1975) (19)
- Gödel's Dialectica Interpretation and Its Two-Way Stretch (1993) (19)
- The Significance of Weyl’s Das Kontinuum (2000) (19)
- Alfred Tarski and the Vienna Circle : austro-polish connections in logical empiricism (1999) (18)
- My route to arithmetization (2008) (18)
- Non-extensional type-free theories of partial operations and classifications, I (1975) (18)
- Which Quantifiers Are Logical? A Combined Semantical and Inferential Criterion (2015) (17)
- Hereditarily Replete Functionals Over the Ordinals (1970) (17)
- Choice principles, the bar rule and autonomously iterated comprehension schemes in analysis (1983) (17)
- Harmonious logic: Craig’s interpolation theorem and its descendants (2008) (16)
- On the strength of some semi-constructive theories (2009) (16)
- Model-Theoretic Logics: Background and Aims (2016) (16)
- UNFOLDING FINITIST ARITHMETIC (2010) (15)
- Relationships between Constructive, Predicative and Classical Systems of Analysis (2000) (14)
- Enriched Stratified Systems for the Foundations of Category Theory (2011) (13)
- Tarski and Gödel: Between the Lines (1999) (13)
- Tarski's influence on computer science (2005) (12)
- H. Rasiowa and R. Sikorski. A proof of the completeness theorem of Gödel. Fundamenta mathemalicae , vol. 37 (for 1950, pub. 1951), pp. 193–200. (1952) (12)
- Between constructive and classical mathematics (1984) (12)
- Review: H. Rasiowa, R. Sikorski, A Proof of the Completeness Theorem of Godel (1952) (11)
- A new approach to abstract data types, I Informal development (1992) (11)
- Computation on Abstract Data Types: The Extensional Approach, with an Application to Streams (1996) (11)
- Impredicativity of the existence of the largest divisible subgroup of an Abelian p-group (1975) (11)
- Challenges to Predicative Foundations of Arithmetic (2021) (11)
- A New Approach to Abstract Data Types II: Computation on ADTs as Ordinary Computation (1991) (11)
- Godel's functional interpretation (1998) (11)
- Penrose's Gödelian Argument A Review of Shadows of the Mind by Roger Penrose (1995) (10)
- ABOUT AND AROUND COMPUTING OVER THE REALS (2012) (10)
- Predicative provability in set theory (1966) (10)
- Tarski's conception of logic (2004) (10)
- The Gödel Editorial Project: A Synopsis (2005) (10)
- Kurt Gödel: Collected Works Vol. Ii (1990) (10)
- Borel Structures and Measure and Category Logics (2016) (9)
- Larger Infinitary Languages (2016) (9)
- The Impact of the Incompleteness Theorems on Mathematics (2006) (9)
- The Proof Theory of Classical and Constructive Inductive Definitions. A Forty Year Saga, 1968 – 2008 (2010) (9)
- The Signiicance of Hermann Weyl's Das Kontinuum (1997) (9)
- SOME FORMAL SYSTEMS FOR THE UNLIMITED THEORY OF STRUCTURES AND CATEGORIES (2004) (9)
- The Metaphysics of Logic: Logic, mathematics, and conceptual structuralism (2014) (8)
- The Number Systems (1964) (8)
- Compactness, Embeddings and Definability (2016) (7)
- Generalizing Set-Theoretical Model Theory and an Analogue Theory on Admissible Sets (1979) (7)
- What Kind of Logic Is " Independence Friendly " Logic? (7)
- Prawitz Dag. Ideas and results in proof theory. Proceedings of the Second Scandinavian Logic Symposium , edited by Fenstad J. E., Studies in logic and the foundations of mathematics, vol. 63, North-Holland Publishing Company, Amsterdam and London 1971, pp. 235–307. (1975) (6)
- Deciding the Undecidable : Wrestling with Hilbert ’ s Problems (2002) (6)
- Remarks for the “Trends in Logic” Panel discussion, Logic Colloquium '88, Padova, 23-30 August, 1988 (1989) (6)
- Lω1ω and Admissible Fragments (2016) (6)
- Comments on “Predicativity as a philosophical position” by G. Hellman (2004) (6)
- Kurt Gödel Collected Works IV-V: Correspondence (2004) (6)
- Review: Gaisi Takeuti, Proof theory (1977) (5)
- Set-Theoretic Definability of Logics (2016) (5)
- The Operational Perspective (2008) (5)
- Turing’s Thesis (2021) (5)
- The development of programs for the foundations of mathematics in the first third of the 20 th century (2002) (5)
- ORDINALS AND FUNCTIONALS IN PROOF THEORY (2010) (4)
- The Operational Perspective: Three Routes (2016) (4)
- Axiomatizing Truth: Why and How? (2012) (4)
- Recursion in total functionals of finite type (1977) (4)
- Parsons and I: Sympathies and Differences (2016) (3)
- Decidability and Quantifier-Elimination (2016) (3)
- A Fortuitous Year with Leon Henkin (2014) (3)
- Highlights in Proof Theory (2000) (3)
- Abstract Embedding Relations (2016) (3)
- Theses for Computation and Recursion on Concrete and Abstract Structures (2015) (3)
- Gödel's incompleteness theorems, free will and mathematical thought (2011) (3)
- Book Review: Proof theory (1977) (3)
- Hightlights in Proof Theory (2000) (3)
- Alfred Tarski and a Watershed Meeting in Logic: Cornell, 1957 (2003) (3)
- Predicativism as a philosophical position. Commentary. Author's reply (2004) (2)
- Kurt Gödel and the Foundations of Mathematics: Lieber Herr Bernays! Lieber Herr Gödel! Gödel on Finitism, Constructivity, and Hilbert's Program (2011) (2)
- SOME APPLICATIONS OF THE NOTIONS OF FORCING AND GENERIC SETS (SUMMARY) (2014) (2)
- Proofs of Termination and the "91" Function (1991) (2)
- Computation on Abstract Data Types. The Extensional Approach, with an Application to Streams (2002) (2)
- Modernism in Mathematics (2009) (2)
- Other Quantifiers: An Overview (2016) (2)
- Working Foundations - ’ 91 (1993) (2)
- Turing's 'Oracle': From Absolute to Relative Computability and Back (2016) (2)
- On Rereading van Heijenoort’s Selected Essays (2012) (2)
- Complexity of type-two functionals and of logical games on finite structures (1998) (2)
- Collected Works of Kurt Godel: Volume I (1987) (1)
- Review: H. Rasiowa, R. Sikorski, A Proof of the Skolem-Lowenheim Theorem (1953) (1)
- Review: Hao Wang, Arithmetic Models for Formal Systems (1955) (1)
- Applications to Algebra (2016) (1)
- On Rereading van Heijenoort’s Selected Essays (2012) (1)
- Review: Kurt Schütte, Proof theory (1979) (1)
- Meeting of the Association for Symbolic Logic, Stanford, California, 1985 (1986) (1)
- Kurt Gödel: SET THEORY (2010) (1)
- Review: A. Grzegorczyk, A. Mostowski, C. Ryll-Nardzewski, The Classical and the $\omega$-Complete Arithmetic (1962) (1)
- Preface: Special Issue of Papers from the Conference on Proof Theory, Provability Logic, and Computation, Berne, Switzerland, 20-24 March 1994 (1995) (1)
- H. Rasiowa and R. Sikorski. A proof of the Skolem-Löwenheim theorem. Fundamenta mathematicae , vol. 38 (for 1951, pub. 1952), pp. 230–232. (1953) (1)
- Definable Second-Order Quantifiers (2016) (1)
- The unfolding of non-nitist arithmetic (2002) (1)
- Review: John Myhill, Solution of a Problem of Tarski; Andrzej Ehrenfeucht, Two Theories with Axioms Built by means of Pleonasms; Hilary Putnam, Decidability and Essential Undecidability (1958) (1)
- Transfer Theorems and Their Applications to Logics (2016) (1)
- Logic and Methodology, Center Stage (2010) (1)
- Proof Theory since 1960 (0)
- Meeting of the Association for Symbolic Logic, Reno, 1976 (1977) (0)
- Review: A. Mostowski, On Recursive Models of Formalised Arithmetic (1958) (0)
- Logics of Topology and Analysis (2016) (0)
- Axiomatizing Truth: Why and How? For Helmut Schwichtenberg on the occasion of his 70th birthday (2012) (0)
- H. Rasiowa. A proof of the compactness theorem for arithmetical classes. Fundamenta mathematicae , vol. 39 (for 1952, pub. 1953), pp. 8–14. (1955) (0)
- REVIEWS-K. Godel collected works IV-V (2004) (0)
- SOLOMON FEFERMAN CATEGORICAL FOUNDATIONS AND FOUNDATIONS OF CATEGORY THEORY (2010) (0)
- Montague Richard. Two contributions to the foundations of set theory. Logic, methodology and philosophy of science, Proceedings of the 1960 International Congress , edited by Nagel Ernest, Suppes Patrick, and Tarski Alfred, Stanford University Press, Stanford, California, 1962, pp. 94–110. (1969) (0)
- In Memoriam: Kenneth Jon Barwise 1942–2000 (2000) (0)
- Mostowski A.. On recursive models of formalised arithmetic. Bulletin de l'Académie Polonaise des Sciences, Classe III, vol. 5 (1957), pp. 705–710. (1958) (0)
- Working foundations (2004) (0)
- THE STUDY OF RECURSIVE PROGRESSIONS OF THEORIES (1961) (0)
- Review: J. R. Shoenfield, Degrees of Models (1968) (0)
- THE STUDY OF PROOFS AND ORDINALS. (1970) (0)
- Communications of the international union of history and philosophy of science division of logic, methodology and philosophy of science (2004) (0)
- Brno, Czech Republic, August 25–29, 1996 (1996) (0)
- Presentation to the panel, “Does mathematics need new axioms?” (2004) (0)
- Review: Richard Montague, Ernest Nagel, Patrick Suppes, Alfred Tarski, Two Contributions to the Foundations of Set Theory (1969) (0)
- REVIEWS-Alfred Tarski, Life and Logic (2005) (0)
- AMERICAN MATHElfaATICAL SOCIETY (1977) (0)
- Preface to the Series Perspectives in Mathematical Logic (2016) (0)
- Rasiowa H. and Sikorski R.. A proof of the Skolem-Löwenheim theorem. Fundamenta mathematicae, vol. 38 , pp. 230–232 (1953) (0)
- Kurt Gödel: The Gödel editorial project: A synopsis (2010) (0)
- Collected Works. Vol. IV: Correspondence A-G. Vol. V: Correspondence H-Z (2004) (0)
- Review: H. Rasiowa, A Proof of the Compactness Theorem for Arithmetical Classes (1955) (0)
- A 40 year saga (2008) (0)
- Review: Azriel Levy, A Hierarchy of Formulas in Set Theory (1968) (0)
- 1 Turing ’ s Thesis (0)
- Second-Order Logic (2016) (0)
- Advanced Topics in Abstract Model Theory (2016) (0)
- Sketch of a remarkable life (2017) (0)
- Reflecting on incompleteness. The Journal of Symbolic Logic, vol. 56 (2010) (0)
- Curtis Franks. The Autonomy of Mathematical Knowledge: Hilbert's Program Revisted. Cambridge: Cambridge University Press, 2009. ISBN 978-0-521-51437-8. Pp. xiii+213 (2012) (0)
- Abstract Equivalence Relations (2016) (0)
- Review: Richard Montague, Theories Incomparable with Respect to Relative Interpretability (1971) (0)
- Review: R. O. Gandy, G. Kreisel, W. W. Tait, Set Existence (1962) (0)
- Kurata Reijiro. Recursive progression of intuitionistic number theories. Journal of the Mathematical Society of Japan, vol. 17 (1965), pp. 140–166. (1973) (0)
- The number systems : foundations for algebra and analysis / Solomon Feferman (1999) (0)
- Lévy Azriel. A hierarchy of formulas in set theory . Memoirs of the American Mathematical Society, no. 57. American Mathematical Society, Providence 1965, 76 pp. (1968) (0)
- Review: Reijiro Kurata, Recursive Progression of Intuitionistic Number Theories (1973) (0)
- Kurt Gödel: PHILOSOPHY OF MATHEMATICS (2010) (0)
- Three Conceptual Problems That Bug (1996) (0)
- 8 Conclusion 7.4 Scenario B: Incremental Model Checking (1995) (0)
- AXIOMATIZING TRUTH: HOW AND WHY (2011) (0)
- 1 Gödel , Nagel , minds and machines (2008) (0)
- Finitary Languages with Additional Quantifiers (2016) (0)
- Clermont-Ferrand, France, July 21–30, 1994 (1995) (0)
- Two PhD Students for the Price of One (2011) (0)
- Skolem Th.. Peano's axioms and models of arithmetic. Mathematical Interpretation of formal systems , Studies in logic and the foundations of mathematics, North-Holland Publishing Company, Amsterdam 1955, pp. 1–14. (1957) (0)
- Introduction, Basic Theory and Examples (2016) (0)
- REVIEWS-Articles in In the light of logic (2001) (0)
- Stanford University, Stanford, CA March 19–22, 2005 (2006) (0)
This paper list is powered by the following services:
Other Resources About Solomon Feferman
What Schools Are Affiliated With Solomon Feferman?
Solomon Feferman is affiliated with the following schools: