OMODEO, EUGENIO
 Distribuzione geografica
Continente #
NA - Nord America 5.008
EU - Europa 3.208
AS - Asia 660
AF - Africa 7
SA - Sud America 7
OC - Oceania 5
Continente sconosciuto - Info sul continente non disponibili 4
Totale 8.899
Nazione #
US - Stati Uniti d'America 4.995
PL - Polonia 815
IT - Italia 612
SE - Svezia 529
UA - Ucraina 484
CN - Cina 233
FI - Finlandia 157
TR - Turchia 153
DE - Germania 144
HK - Hong Kong 130
GB - Regno Unito 124
BG - Bulgaria 99
IE - Irlanda 91
SG - Singapore 83
FR - Francia 66
CH - Svizzera 31
VN - Vietnam 22
BE - Belgio 21
CA - Canada 12
NL - Olanda 10
IN - India 8
BR - Brasile 6
IR - Iran 6
JP - Giappone 6
RU - Federazione Russa 6
MY - Malesia 5
A1 - Anonimo 4
AU - Australia 4
ES - Italia 4
RO - Romania 4
AT - Austria 3
BN - Brunei Darussalam 3
CZ - Repubblica Ceca 3
GR - Grecia 3
SN - Senegal 3
IL - Israele 2
LU - Lussemburgo 2
TH - Thailandia 2
ZA - Sudafrica 2
AM - Armenia 1
BD - Bangladesh 1
CO - Colombia 1
ID - Indonesia 1
KR - Corea 1
KZ - Kazakistan 1
LY - Libia 1
MX - Messico 1
NG - Nigeria 1
NP - Nepal 1
NZ - Nuova Zelanda 1
OM - Oman 1
Totale 8.899
Città #
Warsaw 811
Ann Arbor 750
Woodbridge 731
Houston 519
Fairfield 440
Jacksonville 438
Chandler 377
Wilmington 294
Ashburn 239
Trieste 203
Seattle 183
Princeton 180
Cambridge 155
Izmir 146
Hong Kong 129
Beijing 113
Sofia 99
Bremen 94
Dublin 89
Boardman 74
Singapore 45
San Diego 38
Milan 36
Bern 27
Udine 27
Verona 26
Dong Ket 22
Chicago 20
Mestre 19
Falls Church 15
Brussels 13
Düsseldorf 13
Helsinki 12
Redwood City 12
Vicenza 12
Cividale del Friuli 9
Fremont 9
Los Angeles 9
Nanjing 9
Norwalk 9
Portogruaro 9
Buffalo 8
Des Moines 8
Karlsruhe 8
Santa Lucia Di Piave 8
Auburn Hills 7
Kocaeli 7
London 7
Redmond 7
Venice 7
Hefei 6
Kunming 6
Amsterdam 5
Catania 5
Dubino 5
Indiana 5
Bognor Regis 4
Dearborn 4
Fano 4
Kraków 4
Ottawa 4
Porto Recanati 4
Riverside 4
Toronto 4
Ancona 3
Bandar Seri Begawan 3
Changsha 3
Cutrofiano 3
Dakar 3
Hebei 3
Mountain View 3
Phoenix 3
Rochester 3
Rome 3
Scottsdale 3
Shenyang 3
Siziano 3
Tavagnacco 3
Tokyo 3
Azor 2
Bellaterra 2
Berlin 2
Bologna 2
Bolzano 2
Castelfranco Veneto 2
Chavannes 2
Chengdu 2
Chester 2
Dongguan 2
Dormagen 2
Iesi 2
Islington 2
Jinan 2
Macerata 2
Malo 2
Nanchang 2
Palmanova 2
Petaling Jaya 2
Pignone 2
Pordenone 2
Totale 6.673
Nome #
A Diophantine representation of Wolstenholme's pseudoprimality 318
Proof verification within set theory 281
On Perfect Matchings for some Bipartite Graphs 217
Can a Single Equation Witness that every r.e. Set Admits a Finite-fold Diophantine Representation? 195
Theory-specific automated reasoning 181
Banishing Ultrafilters from Our Consciousness 171
Reasoning on Relations, Modalities, and Sets 171
Decidability results for sets with atoms 160
On the Diophantine complexity of the set of prime numbers 158
An equational re-engineering of set theories 154
Preface to the Proceedings of the 34th Italian Conference on Computational Logic (CILC 2019) 148
Reasoning about connectivity without paths 147
Three-variable statements of set-pairing 140
An environment for specifying properties of dyadic relations and reasoning about them. II: Relational presentation of non-classical logics. 139
Set Graphs. V. On representing graphs as membership digraphs 134
Hyper-Extensionality and One-Node Elimination on Membership Graphs 131
The axiom of elementary sets on the edge of Peircean expressibility 130
Topological syllogistic with continuous and closed functions 130
Does every recursively enumerable set admit a finite-fold diophantine representation? 130
Polynomial-time satisfiability tests for boolean fragments of set theory 128
Set Graphs. III. Proof Pearl: Claw-Free Graphs Mirrored into Transitive Hereditarily Finite Sets 126
Rasiowa-Sikorski style Relational Elementary Set Theory 124
Computable Set Theory, vol. I 123
A `Theory' mechanism for a proof verifier based on first-order set theory 123
Decision procedures for elementary sublanguages of set theory. I: Multi-level syllogistic and some extensions 119
null 118
A proof-checking experiment on representing graphs as membership digraphs 118
A graphical representation of relational formulae with complementation 117
ER modelling from first relational principles 114
The Representation of Boolean Algebras in the Spotlight of a Proof Checker 113
Decision procedures for elementary sublanguages of set theory. II: Formulas involving restricted quantifiers together with ordinal, integer, map, and domain notions 112
Formative processes with applications to the decision problem in set theory: I. Powerset and singleton operators 111
Mapping Sets and Hypersets into Numbers 111
Computational Logic and Set Theory -- Applying Formalized Logic to Analysis 110
Goals and benchmarks for automated map reasoning 109
The Linked Conjunct method for automatic deduction and related search techniques 106
Solvable set/hyperset contexts: I. Some decision procedures for the pure, finite case 102
Bisimilarity, hypersets and stable partitioning: a survey 100
Notes from the logbook of a proof-checker's project 99
Decision algorithms for some fragments of analysis and related areas 98
Layered map reasoning: An experiment put to trial on sets 98
A computerized Referee 94
Martin Davis’s Bibliography 1950–2015 94
An environment for specifying properties of dyadic relations and reasoning about them. I: Language extension mechanisms. 93
Le radici forti dell'Informatica – L'intreccio storico tra tecnologia e fondamenti logici della matematica 92
null 91
Compiling dyadic first-order specifications into map algebra 90
A derived algorithm for evaluating epsilon-expressions over abstract sets 89
Automation of aggregate theories: The cornerstones of equational expressibility. 88
Statements of ill-founded infinity in Set Theory 88
Decidability of E*A-sentences in membership theories 87
Decision procedures for elementary sublanguages of set theory, VII: Validity in set theory when a choice operator is present 84
The Ref Proof-Checker and Its “Common Shared Scenario” 84
A graphical approach to relational reasoning 83
The automation of syllogistic. II: Optimization and complexity issues 82
Decision procedures for elementary sublanguages of set theory. VIII: A semidecision procedure for finite satisfiability of unquantified set-theoretic formulae 81
Transitive Venn diagrams with applications to the decision problem in set theory 81
Three existence principles in a modal calculus without descriptions in A. Bressan's MC^nu 78
Set Theory for Computing - From decision procedures to declarative programming with sets 77
Views on time in systems biology 75
The elimination of descriptions from A. Bressan's modal language ML^nu on which the logical calculus MC^nu is based 75
The Bernays-Schönfinkel-Ramsey class for set theory: decidability. 75
{log}: A logic programming language with finite sets 72
Using AEtnaNova to formally prove that the Davis-Putnam satisfiability test is correct 71
Solvable set/hyperset contexts: II. A goal-driven algorithm for the blended case 70
The Bernays-Schönfinkel-Ramsey class for set theory: semidecidability. 70
The axiom of elementary sets. I: Three-variable statements of set-pairing 66
The automation of syllogistic. I: Syllogistic normal form 65
Self-applied proof verification 64
Preface 64
null 63
Infinity, in short. 63
A language for programming in logic with finite sets 62
The decidability of the Bernays-Shoenfinkel-Ramsey class for set theory 59
Uniform relational frameworks for modal inferences 58
The axiom of elementary sets. II: The edge of Peircean expressibility 56
A Quadratic Reduction of Constraints over Nested Sets to Purely Boolean Formulae in CNF 55
A Decidable Theory of Differentiable Functions with Convexities and Concavities on Real Intervals 51
Solvable (and unsolvable) cases of the decision problem for fragments of analysis 49
On sets and graphs: Perspectives on logic and combinatorics 48
The quest for Diophantine finite-fold-ness 48
Complexity Assessments for Decidable Fragments of Set Theory. I: A Taxonomy for the Boolean Case 48
Complexity assessments for decidable fragments of set theory. II: A taxonomy for ‘small’ languages involving membership 47
Set-syllogistics meet combinatorics 45
Stating infinity in set/hyperset theories 44
null 39
Two Crucial Cubic-Time Components of Polynomial-Maximal Decidable Boolean Languages. 38
From Hilbert's 10th Problem to slim, Undecidable Fragments of Set Theory 37
Very Weak, Essentially Undecidabile Set Theories. 36
Cumulative hierarchies and computability over universes of sets. 27
A Decidable Theory Treating Addition of Differentiable Real Functions. 27
Gerarchie cumulative e computabilità sopra universi d’insiemi 26
A decidable theory involving addition of differentiable real functions 24
Algebraic semantics of ER-models in the context of the calculus of relations. II: Dynamic view. 24
A Brief History of Singlefold Diophantine Definitions 24
Instructing equational set-reasoning with Otter 20
Continued Hereditarily Finite Set-Approximations 11
Reconciling transparency, low Δ0-complexity and axiomatic weakness in undecidability proofs 10
Complexity assessments for decidable fragments of Set Theory. III: Testers for crucial, polynomial-maximal decidable Boolean languages 7
Onset and Today’s Perspectives of Multilevel Syllogistic 5
Totale 9.188
Categoria #
all - tutte 24.281
article - articoli 0
book - libri 0
conference - conferenze 0
curatela - curatele 0
other - altro 0
patent - brevetti 0
selected - selezionate 0
volume - volumi 0
Totale 24.281


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/20201.635 80 57 74 253 134 229 111 196 133 92 176 100
2020/20211.303 125 66 109 186 110 131 75 124 58 136 49 134
2021/2022879 26 78 82 86 8 69 59 46 126 80 73 146
2022/20231.257 115 132 88 130 213 248 17 113 125 5 53 18
2023/2024679 65 47 27 60 75 36 76 155 3 39 62 34
2024/202510 10 0 0 0 0 0 0 0 0 0 0 0
Totale 9.195