Manuel Lerman

1.3k total citations
52 papers, 651 citations indexed

About

Manuel Lerman is a scholar working on Computational Theory and Mathematics, Geometry and Topology and Artificial Intelligence. According to data from OpenAlex, Manuel Lerman has authored 52 papers receiving a total of 651 indexed citations (citations by other indexed papers that have themselves been cited), including 48 papers in Computational Theory and Mathematics, 23 papers in Geometry and Topology and 14 papers in Artificial Intelligence. Recurrent topics in Manuel Lerman's work include Computability, Logic, AI Algorithms (39 papers), Advanced Topology and Set Theory (23 papers) and semigroups and automata theory (22 papers). Manuel Lerman is often cited by papers focused on Computability, Logic, AI Algorithms (39 papers), Advanced Topology and Set Theory (23 papers) and semigroups and automata theory (22 papers). Manuel Lerman collaborates with scholars based in United States and Germany. Manuel Lerman's co-authors include Robert I. Soare, Klaus Ambos‐Spies, Richard A. Shore, Steffen Lempp, Gerald E. Sacks, James H. Schmerl, Stephen G. Simpson, Jeffrey B. Remmel, Reed Solomon and C. T. Chong and has published in prestigious journals such as Annals of Mathematics, Lecture notes in mathematics and Transactions of the American Mathematical Society.

In The Last Decade

Manuel Lerman

50 papers receiving 547 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Manuel Lerman United States	14	606	289	181	74	70	52	651
C. J. Ash Australia	13	553 0.9×	239 0.8×	178 1.0×	53 0.7×	72 1.0×	37	596
J. C. E. Dekker United States	11	334 0.6×	120 0.4×	145 0.8×	29 0.4×	45 0.6×	36	459
Douglas Cenzer United States	11	368 0.6×	145 0.5×	107 0.6×	50 0.7×	49 0.7×	67	428
Victor Selivanov Russia	11	397 0.7×	176 0.6×	128 0.7×	17 0.2×	41 0.6×	79	441
C. E. M. Yates United Kingdom	8	302 0.5×	130 0.4×	107 0.6×	39 0.5×	26 0.4×	12	322
Jerome Malitz United States	10	182 0.3×	130 0.4×	98 0.5×	13 0.2×	65 0.9×	19	287
Alberto Marcone Italy	9	184 0.3×	111 0.4×	53 0.3×	25 0.3×	51 0.7×	32	218
Steffen Lempp United States	14	527 0.9×	169 0.6×	154 0.9×	103 1.4×	29 0.4×	77	543
Dag Normann Norway	10	248 0.4×	94 0.3×	203 1.1×	27 0.4×	82 1.2×	54	308
William W. Boone United States	11	288 0.5×	193 0.7×	125 0.7×	12 0.2×	68 1.0×	21	418

Countries citing papers authored by Manuel Lerman

Since Specialization

Citations

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

Fields of papers citing papers by Manuel Lerman

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Manuel Lerman

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

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Lerman, Manuel, et al.. (2011). CAPPABLE CEA SETS AND RAMSEY'S THEOREM. 114–127.

Lerman, Manuel. (2010). A Framework for Priority Arguments. Cambridge University Press eBooks. 5 indexed citations

Cholak, Peter, Steffen Lempp, Manuel Lerman, & Richard A. Shore. (2000). Computability theory and its applications : current trends and open problems : proceedings of a 1999 AMS-IMS-SIAM Joint Summer Research Conference, Computability Theory and Applications, June 13-17, 1999, University of Colorado, Boulder. American Mathematical Society eBooks. 2 indexed citations

Lerman, Manuel. (1998). A necessary and sufficient condition for embedding ranked finite partial lattices into the computably enumerable degrees. Annals of Pure and Applied Logic. 94(1-3). 143–180. 5 indexed citations

Lempp, Steffen & Manuel Lerman. (1997). A finite lattice without critical triple that cannot be embedded into the enumerable Turing degrees. Annals of Pure and Applied Logic. 87(2). 167–185. 12 indexed citations

Lempp, Steffen & Manuel Lerman. (1996). The Decidability of the Existential Theory of the Poset of Recursively Enumerable Degrees with Jump Relations. Advances in Mathematics. 120(1). 1–142. 6 indexed citations

Lempp, Steffen & Manuel Lerman. (1995). A General Framework for Priority Arguments. Bulletin of Symbolic Logic. 1(2). 189–201. 7 indexed citations

Lerman, Manuel & Richard A. Shore. (1988). Decidability and invariant classes for degree structures. Transactions of the American Mathematical Society. 310(2). 669–692. 17 indexed citations

Lerman, Manuel & Richard A. Shore. (1988). Decidability and Invariant Classes for Degree Structures. Transactions of the American Mathematical Society. 310(2). 669–669. 3 indexed citations

10.

Lerman, Manuel. (1986). Degrees which do not bound minimal degrees. Annals of Pure and Applied Logic. 30(3). 249–276. 13 indexed citations

11.

Lerman, Manuel. (1985). Upper bounds for the arithmetical degrees. Annals of Pure and Applied Logic. 29(3). 225–254. 5 indexed citations

12.

Lerman, Manuel & Robert I. Soare. (1980). A decidable fragment of the elementary theory of the lattice of recursively enumerable sets. Transactions of the American Mathematical Society. 257(1). 1–37. 9 indexed citations

13.

Lerman, Manuel & James H. Schmerl. (1979). Theories with recursive models. Journal of Symbolic Logic. 44(1). 59–76. 13 indexed citations

14.

Lerman, Manuel, Richard A. Shore, & Robert I. Soare. (1978). r-Maximal major subsets. Israel Journal of Mathematics. 31(1). 1–18. 16 indexed citations

15.

Lerman, Manuel. (1976). Types of simple α-recursively enumerable sets. Journal of Symbolic Logic. 41(2). 419–426. 3 indexed citations

16.

Lerman, Manuel. (1972). On suborderings of the α-recursively enumerable α-degrees. Annals of Mathematical Logic. 4(4). 369–392. 18 indexed citations

17.

Lerman, Manuel & Gerald E. Sacks. (1972). Some minimal pairs of α-recursively enumerable degrees. Annals of Mathematical Logic. 4(4). 415–442. 21 indexed citations

18.

Lerman, Manuel. (1971). Some theorems on R-maximal sets and major subsets of recursively enumerable sets. Journal of Symbolic Logic. 36(2). 193–215. 11 indexed citations

19.

Lerman, Manuel. (1970). Turing degrees and many-one degrees of maximal sets. Journal of Symbolic Logic. 35(1). 29–40. 3 indexed citations

20.

Lerman, Manuel. (1970). Turing degrees and many-one degrees of maximal sets. Journal of Symbolic Logic. 35(1). 29–40. 10 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