Stefano Berardi

821 total citations
46 papers, 273 citations indexed

About

Stefano Berardi is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Geometry and Topology. According to data from OpenAlex, Stefano Berardi has authored 46 papers receiving a total of 273 indexed citations (citations by other indexed papers that have themselves been cited), including 38 papers in Artificial Intelligence, 33 papers in Computational Theory and Mathematics and 7 papers in Geometry and Topology. Recurrent topics in Stefano Berardi's work include Logic, programming, and type systems (24 papers), Computability, Logic, AI Algorithms (24 papers) and Logic, Reasoning, and Knowledge (23 papers). Stefano Berardi is often cited by papers focused on Logic, programming, and type systems (24 papers), Computability, Logic, AI Algorithms (24 papers) and Logic, Reasoning, and Knowledge (23 papers). Stefano Berardi collaborates with scholars based in Italy, Japan and United Kingdom. Stefano Berardi's co-authors include Franco Barbanera, Thierry Coquand, Marc Bezem, Susumu Hayashi, Ugo de’Liguoro, Makoto Tatsuta, Ulrich Kohlenbach, Silvio Valentini, Paola Giannini and Ferruccio Damiani and has published in prestigious journals such as SHILAP Revista de lepidopterología, Theoretical Computer Science and Lecture notes in computer science.

In The Last Decade

Stefano Berardi

40 papers receiving 252 citations

Peers

Countries citing papers authored by Stefano Berardi

Since Specialization

Citations

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

Fields of papers citing papers by Stefano Berardi

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Stefano Berardi

This figure shows the co-authorship network connecting the top 25 collaborators of Stefano Berardi. A scholar is included among the top collaborators of Stefano Berardi 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 Stefano Berardi. Stefano Berardi 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

#	Work	Indexed citations
1	Classical System of Martin-Lof's Inductive Definitions is not Equivalent to Cyclic Proofs 2019 ·Logical Methods in Computer Science ·Stefano Berardi, Makoto Tatsuta	2
2	RAMSEY’S THEOREM FOR PAIRS ANDKCOLORS AS A SUB-CLASSICAL PRINCIPLE OF ARITHMETIC 2017 ·Journal of Symbolic Logic ·Stefano Berardi, (unknown)	1
3	An intuitionistic version of Ramsey's Theorem and its use in Program Termination 2015 ·Annals of Pure and Applied Logic ·Stefano Berardi, (unknown)	2
4	Knowledge Spaces and the Completeness of Learning Strategies 2014 ·Logical Methods in Computer Science ·Stefano Berardi, Ugo de’Liguoro	0
5	Proving termination of programs having transition invariants of height omega 2014 ·CEUR Workshop Proceedings ·Stefano Berardi, Paulo Oliva, (unknown)	2
6	Interactive Learning-Based Realizability for Heyting Arithmetic with EM1 2010 ·Logical Methods in Computer Science ·(unknown), Stefano Berardi	25
7	Games with 1-backtracking 2010 ·Annals of Pure and Applied Logic ·Stefano Berardi, Thierry Coquand, Susumu Hayashi	4
8	A Calculus of Realizers for EM1-Arithmetic 2008 ·Stefano Berardi, (unknown)	4
9	Some intuitionistic equivalents of classical principles for degree 2 formulas 2005 ·Annals of Pure and Applied Logic ·Stefano Berardi	7
10	Krivine's intuitionistic proof of classical completeness (for countable languages) 2004 ·Annals of Pure and Applied Logic ·Stefano Berardi, Silvio Valentini	5
11	An arithmetical hierarchy of the law of excluded middle and related principles 2004 ·TUbilio (Technical University of Darmstadt) ·(unknown), Stefano Berardi, Susumu Hayashi, Ulrich Kohlenbach	21
12	Building continuous webbed models for system F 2003 ·Theoretical Computer Science ·Stefano Berardi, (unknown)	0
13	A full continuous model of polymorphism 2002 ·Theoretical Computer Science ·Franco Barbanera, Stefano Berardi	2
14	Intuitionistic completeness for first order classical logic 1999 ·Journal of Symbolic Logic ·Stefano Berardi	2
15	Classical Programming-with-Proofs in lambdaPASym: An Analysis of Non-confluence 1997 ·Franco Barbanera, Stefano Berardi, (unknown)	1
16	A Symmetric Lambda Calculus for Classical Program Extraction 1996 ·Information and Computation ·Franco Barbanera, Stefano Berardi	49
17	A strong normalization result for classical logic 1995 ·Annals of Pure and Applied Logic ·Franco Barbanera, Stefano Berardi	4
18	On the computational content of the Axiom of Choice 1994 ·Project Euclid (Cornell University) ·Stefano Berardi, Marc Bezem, Thierry Coquand	1
19	Retractions on dI-domains as a model for Type:Type 1991 ·Information and Computation ·Stefano Berardi	11
20	Equalization of finite flowers 1988 ·Journal of Symbolic Logic ·Stefano Berardi	0

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