J. W. Addison

617 total citations
9 papers, 227 citations indexed

About

J. W. Addison is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Geometry and Topology. According to data from OpenAlex, J. W. Addison has authored 9 papers receiving a total of 227 indexed citations (citations by other indexed papers that have themselves been cited), including 3 papers in Computational Theory and Mathematics, 2 papers in Artificial Intelligence and 1 paper in Geometry and Topology. Recurrent topics in J. W. Addison's work include Rough Sets and Fuzzy Logic (1 paper), Advanced Topology and Set Theory (1 paper) and Logic, programming, and type systems (1 paper). J. W. Addison is often cited by papers focused on Rough Sets and Fuzzy Logic (1 paper), Advanced Topology and Set Theory (1 paper) and Logic, programming, and type systems (1 paper). J. W. Addison collaborates with scholars based in United States and United Kingdom. J. W. Addison's co-authors include Alfred Tarski, Yiannis N. Moschovakis, S. C. Kleene, Paul Howard, Leon Henkin, Bashir M. Al‐Hashimi and J. Fidler and has published in prestigious journals such as Proceedings of the National Academy of Sciences, Proceedings of the American Mathematical Society and Annals of Pure and Applied Logic.

In The Last Decade

J. W. Addison

8 papers receiving 170 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
J. W. Addison United States 7 150 88 75 39 20 9 227
R. O. Gandy United Kingdom 9 147 1.0× 54 0.6× 74 1.0× 25 0.6× 12 0.6× 16 201
R. E. Vesley United States 5 263 1.8× 62 0.7× 228 3.0× 40 1.0× 27 1.4× 9 364
Wolfram Pohlers Germany 8 224 1.5× 61 0.7× 177 2.4× 35 0.9× 44 2.2× 17 292
Akiko Kino Ghana 5 163 1.1× 25 0.3× 131 1.7× 30 0.8× 19 0.9× 8 229
Wilfried Buchholz Germany 11 338 2.3× 85 1.0× 278 3.7× 38 1.0× 36 1.8× 25 423
William N. Reinhardt United States 6 186 1.2× 189 2.1× 57 0.8× 114 2.9× 55 2.8× 8 307
Dag Normann Norway 10 248 1.7× 94 1.1× 203 2.7× 82 2.1× 8 0.4× 54 308
Henryk Kotlarski Poland 11 195 1.3× 169 1.9× 85 1.1× 96 2.5× 48 2.4× 35 311
H. Läuchli United States 7 138 0.9× 109 1.2× 55 0.7× 34 0.9× 5 0.3× 9 196
Roman Kossak United States 9 144 1.0× 175 2.0× 39 0.5× 105 2.7× 11 0.6× 39 242

Countries citing papers authored by J. W. Addison

Since Specialization
Citations

This map shows the geographic impact of J. W. Addison'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 J. W. Addison with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites J. W. Addison more than expected).

Fields of papers citing papers by J. W. Addison

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by J. W. Addison. 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 J. W. Addison. The network helps show where J. W. Addison may publish in the future.

Co-authorship network of co-authors of J. W. Addison

This figure shows the co-authorship network connecting the top 25 collaborators of J. W. Addison. A scholar is included among the top collaborators of J. W. Addison based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with J. W. Addison. J. W. Addison is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

9 of 9 papers shown
1.
Addison, J. W.. (2004). Tarski's theory of definability: common themes in descriptive set theory, recursive function theory, classical pure logic, and finite-universe logic. Annals of Pure and Applied Logic. 126(1-3). 77–92. 8 indexed citations
2.
Al‐Hashimi, Bashir M., et al.. (2003). Solution of nonlinear equations in the synthesis of linear networks. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 131–133.
3.
Addison, J. W., et al.. (1992). Automated Development of Fundamental Mathematical Theories. Medical Entomology and Zoology. 25 indexed citations
4.
Addison, J. W., Leon Henkin, Alfred Tarski, & Paul Howard. (1975). The Fraenkel-Mostowski Method for Independence Proofs in Set Theory. 5 indexed citations
5.
Addison, J. W. & Yiannis N. Moschovakis. (1968). SOME CONSEQUENCES OF THE AXIOM OF DEFINABLE DETERMINATENESS. Proceedings of the National Academy of Sciences. 59(3). 708–712. 27 indexed citations
6.
Addison, J. W., et al.. (1965). The Theory of Models Proceedings of the 1963 International Symposium at Berkeley. North-Holland eBooks. 46 indexed citations
7.
Addison, J. W.. (1959). Some consequences of the axiom of constructibility. Fundamenta Mathematicae. 46(3). 337–357. 59 indexed citations
8.
Addison, J. W.. (1958). Separation principles in the hierarchies of classical and effective descriptive set theory. Fundamenta Mathematicae. 46(2). 123–135. 43 indexed citations
9.
Addison, J. W. & S. C. Kleene. (1957). A note on function quantification. Proceedings of the American Mathematical Society. 8(5). 1002–1006. 14 indexed citations

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