Solomon Feferman

10.6k citations
98 papers · 4.2k indexed · 1 hit paper · h-index 24

Impact in

Papers in

Solomon Feferman

91 papers receiving 3.4k citations

Hit Papers

Theory of Recursive Functions and Effective Computability. 1969 · 1.7k citations
1.7k196920261988200750010001.5k

Peers

Solomon Feferman
Comparison fields: 5 of 103
  • Theoretical Computer Science 299
  • Computational Theory and Mathematics 3.0k
  • Geometry and Topology 756
  • History and Philosophy of Science 388
  • Artificial Intelligence 2.1k
Replace H. Jerome Keisler with:
H. Jerome Keisler United States
Abraham Robinson United States
Stephen G. Simpson United States
Dana Scott United States
George Boolos United States
Helena Rasiowa Poland
Wilfrid Hodges United Kingdom
John P. Burgess United States
J. R. Shoenfield United States
G. Kreisel United States
Solomon Feferman relative to H. Jerome Keisler United States H. Jerome Keisler's profile →
Citations per field
00.5×2.8×
H. Jerome Keisler · 1×
Citations per year

Countries citing papers authored by Solomon Feferman

Since Specialization
Citations

This map shows the geographic impact of Solomon Feferman's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Solomon Feferman with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Solomon Feferman more than expected).

Fields of papers citing papers by Solomon Feferman

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Solomon Feferman. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Solomon Feferman. The network helps show where Solomon Feferman may publish in the future.

Co-authorship network

The 25 scholars most cited alongside Solomon Feferman, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.

Border = papers with Solomon Feferman Line = papers co-authored together Solomon Feferman links everyone, so they are left out of the graph.

All Works

20 of 20 papers shown
#Work
1 20160
2 200911
3 20069
4 20034
5 200014
6
Alfred Tarski and the Vienna Circle : austro-polish connections in logical empiricism
19995
7
Kurt Gödel: Collected Works, Vol. I: Publications 1929-1936
19983
8 199843
9
Penrose's Gödelian Argument A Review of Shadows of the Mind by Roger Penrose
19953
10
Preface: Special Issue of Papers from the Conference on Proof Theory, Provability Logic, and Computation, Berne, Switzerland, 20-24 March 1994.
19951
11 19950
12
Logics for termination and correctness of functional programs, II. logic of strength PRA
19939
13
Jean van Heijenoort (1912--1986)
19921
14
Mechanizing proof theory: resource-aware logics and proof-transformations to extract implicit information
19906
15
Turing in the land of O(z)
19885
16
Kurt Godel: collected works. Vol. 1: Publications 1929-1936
19863
17
Recursion in total functionals of finite type
19771
18
Persistent and invariant formulas for outer extensions
196827
19 196252
20
Review: H. Rasiowa, R. Sikorski, A Proof of the Skolem-Lowenheim Theorem
19531

About Solomon Feferman

Solomon Feferman is a scholar working on Theoretical Computer Science, Computational Theory and Mathematics, History and Philosophy of Science, Geometry and Topology and Experimental and Cognitive Psychology, having authored 98 papers that have together received 4.2k indexed citations. Recurring topics across this work include Logic, Reasoning, and Knowledge (35 papers), Computability, Logic, AI Algorithms (30 papers), Logic, programming, and type systems (20 papers), History and Theory of Mathematics (20 papers), Philosophy and Theoretical Science (17 papers), Advanced Algebra and Logic (16 papers), Advanced Topology and Set Theory (10 papers) and Philosophy, Science, and History (8 papers). The work is most often cited by research in Theoretical Computer Science (299 citations), Computational Theory and Mathematics (3.0k citations), Geometry and Topology (756 citations), History and Philosophy of Science (388 citations) and Artificial Intelligence (2.1k citations). Solomon Feferman has collaborated with scholars based in United States, Switzerland and Germany. Frequent co-authors include Hartley Rogers, Kurt Gödel, Wilfried Sieg, Wilfried Buchholz, Wolfram Pohlers, Clifford Spector, Gerhard Jäger, Gerhard Jäger, Penelope Maddy and G. Kreisel. Their work appears in journals such as Journal of Symbolic Logic, Annals of Pure and Applied Logic, Synthese, The Review of Symbolic Logic and Archive for Mathematical Logic.

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026