Richard Statman
-
- Advanced Algebra and Logic 9
- semigroups and automata theory 6
- Computability, Logic, AI Algorithms 4
- Advanced Graph Theory Research 2
- Formal Methods in Verification 2
- Artificial Intelligence top 5%
- Logic, Reasoning, and Knowledge 16
- Logic, programming, and type systems 13
- Semantic Web and Ontologies 2
- Signal Processing top 10%
- Co-authors
- M. DowdRonald FaginCatriel BeeriJonathan L. GrossMerrick L. FurstBenedetto IntrigilaJohn C. CherniavskyHarry R. Lewis
- Cited by
- Computational Theory and MathematicsArtificial IntelligenceDiscrete Mathematics and Combinatorics
- Journals
- Theoretical Computer Science (2 papers)Journal of Combinatorial Theory Series B (1 paper)Journal of Graph Theory (1 paper)
- Partner nations
- United StatesItalyIsrael
In The Last Decade
Richard Statman
23 papers receiving 442 citations
Peers
Comparison fields: 5 of 38
- Computational Theory and Mathematics 300
- Artificial Intelligence 372
- Discrete Mathematics and Combinatorics 35
- Signal Processing 57
- Computer Networks and Communications 103
Countries citing papers authored by Richard Statman
This map shows the geographic impact of Richard Statman'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 Richard Statman with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Richard Statman more than expected).
Fields of papers citing papers by Richard Statman
This network shows the impact of papers produced by Richard Statman. 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 Richard Statman. The network helps show where Richard Statman may publish in the future.
Co-authorship network
The 23 scholars most cited alongside Richard Statman, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 2018 | 1 | |
| 2 | 2018 | 0 | |
| 3 | 2018 | 0 | |
| 4 | 2018 | 0 | |
| 5 | The Omega Rule is P 1 1 -Complete in the lambdabeta -Calculus. | 2007 | 0 |
| 6 | 2004 | 0 | |
| 7 | 2004 | 4 | |
| 8 | 1997 | 3 | |
| 9 | 1994 | 12 | |
| 10 | Empty types in polymorphic lambda-calculus | 1990 | 4 |
| 11 | 1989 | 62 | |
| 12 | 1988 | 6 | |
| 13 | 1986 | 5 | |
| 14 | 1984 | 101 | |
| 15 | 1982 | 1 | |
| 16 | Number Theoretic Functions Computable by Polymorphic Programs (Extended Abstract) | 1981 | 1 |
| 17 | 1979 | 77 | |
| 18 | 1979 | 118 | |
| 19 | 1978 | 48 | |
| 20 | Structural complexity of proofs | 1974 | 27 |
About Richard Statman
Richard Statman is a scholar working on Computational Theory and Mathematics, Artificial Intelligence, Algebra and Number Theory, Discrete Mathematics and Combinatorics and Mathematical Physics, having authored 29 papers that have together received 492 indexed citations. Recurring topics across this work include Logic, Reasoning, and Knowledge (16 papers), Logic, programming, and type systems (13 papers), Advanced Algebra and Logic (9 papers), semigroups and automata theory (6 papers), Computability, Logic, AI Algorithms (4 papers), Semantic Web and Ontologies (2 papers), Advanced Graph Theory Research (2 papers) and Formal Methods in Verification (2 papers). The work is most often cited by research in Computational Theory and Mathematics (300 citations), Artificial Intelligence (372 citations), Discrete Mathematics and Combinatorics (35 citations), Signal Processing (57 citations) and Computer Networks and Communications (103 citations). Richard Statman has collaborated with scholars based in United States, Italy and Israel. Frequent co-authors include M. Dowd, Ronald Fagin, Catriel Beeri, Jonathan L. Gross, Merrick L. Furst, Benedetto Intrigila, John C. Cherniavsky, Harry R. Lewis, Henk Barendregt and Paliath Narendran. Their work appears in journals such as Theoretical Computer Science, Journal of Combinatorial Theory Series B, Journal of Graph Theory, Journal of Symbolic Logic and Journal of Functional Programming.
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.