Daniël Leivant
Impact in
-
- Formal Methods in Verification
- Computability, Logic, AI Algorithms
- semigroups and automata theory
- Advanced Algebra and Logic
- Artificial Intelligence top 2%
- Logic, programming, and type systems
- Logic, Reasoning, and Knowledge
- Semantic Web and Ontologies
Papers in
-
- Logic, programming, and type systems 40
- Logic, Reasoning, and Knowledge 30
- Semantic Web and Ontologies 3
-
- Formal Methods in Verification 13
- Computability, Logic, AI Algorithms 12
- Advanced Algebra and Logic 11
- semigroups and automata theory 7
- Co-authors
- Steven Fortune (1 shared paper)Michael O’Donnell (1 shared paper)Jean-Yves Marion (3 shared papers)Phokion G. Kolaitis (1 shared paper)Tim Fernando (1 shared paper)Jean-Yves Marion (1 shared paper)Kim B. Bruce (1 shared paper)Moshe Y. Vardi (1 shared paper)
- Journals
- Journal of Symbolic Logic (5 papers)Theoretical Computer Science (5 papers)Information and Computation (4 papers)Mathematical Structures in Computer Science (2 papers)Annals of Pure and Applied Logic (2 papers)
- Partner nations
- United StatesFranceGermany
In The Last Decade
Daniël Leivant
49 papers receiving 633 citations
Peers
Comparison fields: 5 of 35
- Computational Theory and Mathematics 566
- Artificial Intelligence 699
- Hardware and Architecture 39
- Software 13
- Computer Networks and Communications 65
Countries citing papers authored by Daniël Leivant
This map shows the geographic impact of Daniël Leivant'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 Daniël Leivant with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Daniël Leivant more than expected).
Fields of papers citing papers by Daniël Leivant
This network shows the impact of papers produced by Daniël Leivant. 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 Daniël Leivant. The network helps show where Daniël Leivant may publish in the future.
Co-authors
The 8 scholars most cited alongside Daniël Leivant, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 53 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 1983 | 105 | |
| 2 | 1983 | 90 | |
| 3 | 1993 | 48 | |
| 4 | 1983 | 48 | |
| 5 | 1993 | 42 | |
| 6 | 1994 | 37 | |
| 7 | 1989 | 33 | |
| 8 | Higher order logic | 1994 | 29 |
| 9 | 1991 | 27 | |
| 10 | 1981 | 26 | |
| 11 | 1986 | 24 | |
| 12 | 1985 | 23 | |
| 13 | 1983 | 20 | |
| 14 | 1990 | 20 | |
| 15 | Absoluteness of intuitionistic logic | 1979 | 18 |
| 16 | 1990 | 16 | |
| 17 | 1979 | 13 | |
| 18 | 1987 | 11 | |
| 19 | 1985 | 11 | |
| 20 | Ramified Recurrence and Computational Complexity IV : Predicative Functionals and Poly-Space | 2000 | 9 |
About Daniël Leivant
Daniël Leivant is a scholar working on Artificial Intelligence, Computational Theory and Mathematics, Computer Networks and Communications, Mathematical Physics and Information Systems, having authored 53 papers that have together received 743 indexed citations. Recurring topics across this work include Logic, programming, and type systems (40 papers), Logic, Reasoning, and Knowledge (30 papers), Formal Methods in Verification (13 papers), Computability, Logic, AI Algorithms (12 papers), Advanced Algebra and Logic (11 papers), semigroups and automata theory (7 papers), Advanced Database Systems and Queries (6 papers) and Semantic Web and Ontologies (3 papers). The work is most often cited by research in Computational Theory and Mathematics (566 citations), Artificial Intelligence (699 citations), Hardware and Architecture (39 citations), Software (13 citations) and Computer Networks and Communications (65 citations). Daniël Leivant has collaborated with scholars based in United States, France and Germany. Frequent co-authors include Steven Fortune, Michael O’Donnell, Jean-Yves Marion, Phokion G. Kolaitis, Tim Fernando, Jean-Yves Marion, Kim B. Bruce and Moshe Y. Vardi. Their work appears in journals such as Journal of Symbolic Logic, Theoretical Computer Science, Information and Computation, Mathematical Structures in Computer Science and Annals of Pure and Applied 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.