Daniel J. Velleman

1.7k total citations
68 papers, 640 citations indexed

About

Daniel J. Velleman is a scholar working on Geometry and Topology, Computational Theory and Mathematics and Theoretical Computer Science. According to data from OpenAlex, Daniel J. Velleman has authored 68 papers receiving a total of 640 indexed citations (citations by other indexed papers that have themselves been cited), including 19 papers in Geometry and Topology, 17 papers in Computational Theory and Mathematics and 8 papers in Theoretical Computer Science. Recurrent topics in Daniel J. Velleman's work include Advanced Topology and Set Theory (11 papers), Computability, Logic, AI Algorithms (10 papers) and History and Theory of Mathematics (8 papers). Daniel J. Velleman is often cited by papers focused on Advanced Topology and Set Theory (11 papers), Computability, Logic, AI Algorithms (10 papers) and History and Theory of Mathematics (8 papers). Daniel J. Velleman collaborates with scholars based in United States, Netherlands and Germany. Daniel J. Velleman's co-authors include Gregory S. Call, David Beaver, Stan Wagon, Edgar Onea, Émilie Destruel, Gregory S. Warrington, Alexander L. George, Daniel H. Ullman, Victor Katz and Douglas B. West and has published in prestigious journals such as Transactions of the American Mathematical Society, The Philosophical Review and The Journal of Philosophy.

In The Last Decade

Daniel J. Velleman

51 papers receiving 574 citations

Peers

Daniel J. Velleman
Arthur T. Benjamin United States
Steven R. Finch United States
Raphael M. Robinson United States
Marvin J. Greenberg United States
Peter Hilton United States
N. L. Biggs United Kingdom
Daniel J. Velleman
Citations per year, relative to Daniel J. Velleman Daniel J. Velleman (= 1×) peers Henry J. Ricardo

Countries citing papers authored by Daniel J. Velleman

Since Specialization
Citations

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

Fields of papers citing papers by Daniel J. Velleman

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Daniel J. Velleman

This figure shows the co-authorship network connecting the top 25 collaborators of Daniel J. Velleman. A scholar is included among the top collaborators of Daniel J. Velleman 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 Daniel J. Velleman. Daniel J. Velleman is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Ullman, Daniel H., Daniel J. Velleman, Stan Wagon, & Douglas B. West. (2024). Problems and Solutions. American Mathematical Monthly. 131(9). 814–824.
2.
Ullman, Daniel H., Daniel J. Velleman, Stan Wagon, & Douglas B. West. (2023). Problems and Solutions. American Mathematical Monthly. 130(10). 952–962.
3.
Ullman, Daniel H., Daniel J. Velleman, Stan Wagon, & Douglas B. West. (2023). Problems and Solutions. American Mathematical Monthly. 130(6). 587–596.
4.
Ullman, Daniel H., Daniel J. Velleman, Stan Wagon, & Douglas B. West. (2023). Problems and Solutions. American Mathematical Monthly. 130(7). 679–688.
5.
Velleman, Daniel J. & Stan Wagon. (2020). Bicycle or Unicycle?. American Mathematical Society eBooks.
6.
Velleman, Daniel J.. (2014). A Drug-Induced Random Walk. American Mathematical Monthly. 121(4). 299–299. 1 indexed citations
7.
Velleman, Daniel J., et al.. (2012). It-clefts are IT (Inquiry Terminating) constructions. Proceedings from Semantics and Linguistic Theory. 22. 441–441. 37 indexed citations
8.
Velleman, Daniel J.. (2006). Variable declarations in natural deduction. Annals of Pure and Applied Logic. 144(1-3). 133–146. 3 indexed citations
9.
Velleman, Daniel J.. (2006). How to Prove It. Cambridge University Press eBooks. 14 indexed citations
10.
Velleman, Daniel J.. (2004). Simpson Symmetrized and Surpassed. Mathematics Magazine. 77(1). 31–45. 2 indexed citations
11.
Velleman, Daniel J.. (2004). Simpson Symmetrized and Surpassed. Mathematics Magazine. 77(1). 31–31. 2 indexed citations
12.
George, Alexander L. & Daniel J. Velleman. (2000). Leveling the Playing Field Between Mind and Machine. The Journal of Philosophy. 97(8). 456–461. 1 indexed citations
13.
Velleman, Daniel J.. (1999). Multivariable Calculus and the Plus Topology. American Mathematical Monthly. 106(8). 733–733. 1 indexed citations
14.
Velleman, Daniel J., et al.. (1991). Counting binary trees. Mathematics and computer education. 25(1). 22–29. 1 indexed citations
15.
Velleman, Daniel J.. (1990). Partitioning pairs of countable sets of ordinals. Journal of Symbolic Logic. 55(3). 1019–1021. 3 indexed citations
16.
Velleman, Daniel J.. (1986). On a combinatorial principle of Hajnal and Komjáth. Journal of Symbolic Logic. 51(4). 1056–1060. 3 indexed citations
17.
Velleman, Daniel J.. (1984). 𝜔-morasses, and a weak form of Martin’s axiom provable in 𝑍𝐹𝐶. Transactions of the American Mathematical Society. 285(2). 617–627. 8 indexed citations
19.
Velleman, Daniel J.. (1983). On a generalization of Jensen's □κ, and strategic closure of partial orders. Journal of Symbolic Logic. 48(4). 1046–1052. 3 indexed citations
20.
Velleman, Daniel J.. (1982). Morasses, diamond, and forcing. Annals of Mathematical Logic. 23(2-3). 199–281. 34 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