BERARDI, Stefano
 Distribuzione geografica
Continente #
NA - Nord America 2.685
EU - Europa 1.930
AS - Asia 690
Continente sconosciuto - Info sul continente non disponibili 2
OC - Oceania 2
AF - Africa 1
Totale 5.310
Nazione #
US - Stati Uniti d'America 2.665
CN - Cina 362
DK - Danimarca 340
SE - Svezia 278
FR - Francia 264
IT - Italia 264
IE - Irlanda 164
UA - Ucraina 155
DE - Germania 151
SG - Singapore 118
FI - Finlandia 117
GB - Regno Unito 90
KR - Corea 86
JP - Giappone 63
PL - Polonia 46
VN - Vietnam 34
CA - Canada 20
RU - Federazione Russa 18
BE - Belgio 15
CZ - Repubblica Ceca 8
ID - Indonesia 8
IN - India 8
GR - Grecia 7
NL - Olanda 7
HK - Hong Kong 6
BG - Bulgaria 2
EU - Europa 2
NO - Norvegia 2
TW - Taiwan 2
AE - Emirati Arabi Uniti 1
AL - Albania 1
AU - Australia 1
CH - Svizzera 1
IR - Iran 1
NZ - Nuova Zelanda 1
SA - Arabia Saudita 1
TG - Togo 1
Totale 5.310
Città #
Ann Arbor 816
Santa Clara 282
Beijing 221
Villeurbanne 208
Dublin 164
Wilmington 149
Chandler 127
Guangzhou 98
Jacksonville 97
Dearborn 93
Singapore 82
Houston 75
Torino 69
Nyköping 63
Fairfield 59
Medford 59
Princeton 59
Ashburn 57
Columbus 51
Warsaw 46
Woodbridge 35
Pisa 27
Boston 23
Seattle 21
Milan 20
Verona 20
Boardman 19
Dong Ket 18
Cambridge 16
Norwalk 16
Turin 16
Wayne 14
San Mateo 13
Brussels 12
Toronto 11
Helsinki 10
Jakarta 8
Lachine 8
Naples 8
Fremont 7
Padova 7
Philadelphia 7
Redwood City 7
Falls Church 6
Grafing 6
Nanjing 6
Redmond 6
Hefei 5
Mountain View 5
Coimbatore 4
Cornate 4
Hong Kong 4
New Windsor 4
Acworth 3
Ludwigshafen 3
New York 3
Phoenix 3
San Diego 3
Svendborg 3
Wuhan 3
Amsterdam 2
Anagni 2
Auburn Hills 2
Brno 2
Chiyoda-ku 2
Dallas 2
Des Moines 2
Düsseldorf 2
Feltre 2
Grugliasco 2
Hangzhou 2
Karlsruhe 2
Kunming 2
Landshut 2
Leinì 2
Leuven 2
London 2
Los Angeles 2
Moscow 2
Nanchang 2
Nettuno 2
Ningbo 2
Rome 2
Saint Paul 2
San Mauro Torinese 2
Simi Valley 2
Sofia 2
Stavanger 2
Trento 2
Wenzhou 2
Aosta 1
Beinasco 1
Bengaluru 1
Bolzano 1
Borås 1
Bremen 1
Burolo 1
Catania 1
Changsha 1
Chaoyang 1
Totale 3.359
Nome #
Ramsey's theorem for pairs and K colors as a sub-classical principle of arithmetic 314
Classical system of Martin-Lof's inductive definitions is not equivalent to cyclic proof system 268
Non-monotonic Pre-fix Points and Learning 265
Equivalence of inductive definitions and cyclic proofs under arithmetic 263
An analysis of the Podelski–Rybalchenko termination theorem via bar recursion 250
Intuitionistic podelski-rybalchenko theorem and equivalence between inductive definitions and cyclic proofs 227
An intuitionistic version of Ramsey Theorem and its use in Program Termination 164
Knowledge Spaces and the Completeness of Learning Strategies 156
Ramsey Theorem for Pairs As a Classical Principle in Intuitionistic Arithmetic 120
Ramsey Theorem as an Intuitionistic Property of Well Founded Relations 119
Non-monotonic Pre-fixed Points and Learning 116
Realizability and strong normalization for a curry-howard interpretation of HA + EM1 114
Type Based Useless-Code Elimination for Functional Programs 108
Proving termination of programs having transition invariants of height omega 106
null 106
"Proof-irrelevance out of Excluded Middle and Choice in the Calculus of Constructions." 104
A Full Continuous Model of Polymorphism 104
"A Symmetric Lambda-Calculus for ``Classical'' Program Extraction" 103
Preface 103
Type-based useless-code elimination for functional programs - Position paper 102
Interactive realizers. A new approach to program extraction from non constructive proofs 99
Beta-eta-complete models for System F 92
Games with sequential backtracking and complete game semantics for subclassical logics 92
Semantics for Intuitionistic Arithmetic Based on Tarski Games with Retractable Moves 90
Positive Arithmetic Without Exchange Is a Subclassical Logic 83
Types for Proofs and Programs International Conference, TYPES 2008 Torino, Italy, March 26-29, 2008 Revised Selected Papers 83
An Arithmetical Hierarchy of the Law of Excluded Middle and Related Principles 82
"On the Constructive Content of the Axiom of Choice." 82
"Pruning Simply Typed Lambda Terms" 81
Types for Proofs and Programs, International Workshop, TYPES 2003, Torino, Italy, April 30 - May 4, 2003, Revised Selected Papers 81
Intuitionistic Completness for First Order Classical Logic 75
Toward the interpretation of non constructive reasoning as non-monotonic learning 67
International Conference TYPES 2008 66
Calculi, types and applications: Essays in honour of M. Coppo, M. Dezani-Ciancaglini and S. Ronchi Della Rocca 64
Building Continuous Webbed Model for system F 63
A generalization of conservativity theorem for classical versus intuitionistic arithmetic 63
Internal Models of System F for Decompilation 63
26th International Conference on Types for Proofs and Programs, TYPES 2020 59
EXPLICIT INDUCTION IS NOT EQUIVALENT TO CYCLIC PROOFS FOR CLASSICAL LOGIC WITH INDUCTIVE DEFINITIONS 58
Total functionals and well-founded strategies 57
A Calculus of Realizers for EM1-Arithmetic 57
Classical Logic as Limit Completion 56
Krivine's intuitionistic proof of Classical Completeness 55
Internal Normalization, Compilation and Decompilation for System F 55
Knowledge Spaces and the Completeness of Learning Strategies 54
Interactive Learning-Based Realizability Interpretation for Heyting Arithmetic with EM1 53
Games with 1-backtracking 53
A sequent calculus for limit computable mathematics 52
Interactive Learning-Based Realizability for Heyting Arithmetic with EM1 49
Non-Commutative Infinitary Peano Arithmetic 46
Some intuitionistic equivalents of classical principles for degree 2 formulas 45
Special Issue: Classical Logic and Computation (2006) 45
Types for Proofs and Programs (International Workshop TYPES'95, Selected Papers) 42
Logic for Pragmatics 38
"Termination of Rewriting on Reversible Boolean Circuits as a free 3-Category problem" Adriano Barile, Stefano Berardi and Luca Roversi ICTCS 2023 24th Italian Conference on Theoretical Computer Science 2023, Manuela Flore, Giuseppe Romana Editors CEUR Workshop Proceedings 37
Preface 32
Classical and Intuitionistic Arithmetic with Higher Order Comprehension Coincide on Inductive Well-Foundedness 27
Proceedings of CSL 24 in Leibniz International Proceedings in Informatics (LIPIcs) [LIPIcs, Volume 288, CSL 2024] 12
Totale 5.520
Categoria #
all - tutte 14.391
article - articoli 0
book - libri 0
conference - conferenze 5.980
curatela - curatele 0
other - altro 0
patent - brevetti 0
selected - selezionate 0
volume - volumi 0
Totale 20.371


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/2020694 0 0 0 0 77 119 102 47 106 90 88 65
2020/20211.260 95 38 70 63 119 116 139 115 164 161 115 65
2021/2022569 16 19 27 37 45 11 84 44 6 27 135 118
2022/2023574 64 5 7 37 77 208 53 30 71 0 15 7
2023/2024242 18 46 13 16 13 33 16 1 1 12 38 35
2024/2025491 3 29 23 72 364 0 0 0 0 0 0 0
Totale 5.520