ArTS Archivio della ricerca di Trieste

OMODEO, EUGENIO
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 7.217
EU - Europa 4.166
AS - Asia 3.735
SA - Sud America 341
AF - Africa 71
OC - Oceania 15
Continente sconosciuto - Info sul continente non disponibili 5
Totale 15.550
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 7.114
SG - Singapore 1.397
PL - Polonia 937
IT - Italia 839
CN - Cina 821
SE - Svezia 536
UA - Ucraina 491
HK - Hong Kong 339
KR - Corea 313
BR - Brasile 263
VN - Vietnam 258
DE - Germania 237
FR - Francia 228
FI - Finlandia 198
GB - Regno Unito 187
TR - Turchia 177
BD - Bangladesh 168
RU - Federazione Russa 130
BG - Bulgaria 101
IE - Irlanda 95
NL - Olanda 65
CA - Canada 62
IN - India 47
CH - Svizzera 31
JP - Giappone 31
AR - Argentina 26
BE - Belgio 25
IQ - Iraq 24
MX - Messico 20
PK - Pakistan 19
ZA - Sudafrica 19
ID - Indonesia 18
SA - Arabia Saudita 15
ES - Italia 14
AT - Austria 13
AU - Australia 13
MY - Malesia 13
EC - Ecuador 12
IL - Israele 12
PH - Filippine 12
CO - Colombia 11
UZ - Uzbekistan 11
MA - Marocco 10
CL - Cile 9
CI - Costa d'Avorio 8
IR - Iran 8
TH - Thailandia 8
DZ - Algeria 7
KE - Kenya 7
NP - Nepal 7
RO - Romania 7
JO - Giordania 6
TN - Tunisia 6
UY - Uruguay 6
BN - Brunei Darussalam 5
CZ - Repubblica Ceca 5
EG - Egitto 5
GR - Grecia 5
VE - Venezuela 5
A1 - Anonimo 4
JM - Giamaica 4
OM - Oman 4
PY - Paraguay 4
SN - Senegal 4
AE - Emirati Arabi Uniti 3
AL - Albania 3
CR - Costa Rica 3
DO - Repubblica Dominicana 3
KZ - Kazakistan 3
LU - Lussemburgo 3
AM - Armenia 2
AZ - Azerbaigian 2
BH - Bahrain 2
BS - Bahamas 2
DK - Danimarca 2
EE - Estonia 2
HR - Croazia 2
HU - Ungheria 2
LT - Lituania 2
NG - Nigeria 2
NZ - Nuova Zelanda 2
PE - Perù 2
SV - El Salvador 2
TT - Trinidad e Tobago 2
AF - Afghanistan, Repubblica islamica di 1
AW - Aruba 1
BB - Barbados 1
BO - Bolivia 1
BY - Bielorussia 1
CG - Congo 1
CY - Cipro 1
ET - Etiopia 1
GE - Georgia 1
GT - Guatemala 1
GY - Guiana 1
HN - Honduras 1
KG - Kirghizistan 1
KW - Kuwait 1
LB - Libano 1
LI - Liechtenstein 1
Totale 15.538
Salva come PNG Salva come JPEG
Città #
Warsaw 834
Singapore 803
Ann Arbor 750
Woodbridge 731
Ashburn 538
Houston 521
Fairfield 440
Jacksonville 440
San Jose 416
Chandler 378
Hong Kong 333
Seoul 310
Dallas 308
Wilmington 297
Hefei 278
Trieste 227
Beijing 193
Seattle 190
Princeton 180
Boardman 177
Cambridge 155
Izmir 146
Chicago 129
Sofia 100
Columbus 97
Bremen 94
Zgierz 93
Dublin 92
Moscow 89
Lauterbourg 86
Milan 82
Los Angeles 81
The Dalles 70
Ho Chi Minh City 69
Council Bluffs 66
Hanoi 57
Buffalo 53
Santa Clara 51
New York 44
San Diego 38
Helsinki 33
Udine 32
Munich 30
Frankfurt am Main 29
Bern 27
Düsseldorf 26
Verona 26
Dong Ket 22
London 21
Tokyo 21
Mestre 19
São Paulo 18
Brussels 17
Toronto 17
Miano 16
Montreal 16
Venice 16
Falls Church 15
Rome 14
Brooklyn 13
Orem 13
Vicenza 13
Johannesburg 12
Redwood City 12
Tianjin 12
Turku 12
Amsterdam 11
Rio de Janeiro 11
Des Moines 10
Dhaka 10
Guangzhou 10
Shenzhen 10
Atlanta 9
Boston 9
Cividale del Friuli 9
Fremont 9
Lappeenranta 9
Nanjing 9
Norwalk 9
Nuremberg 9
Portogruaro 9
Redondo Beach 9
Tashkent 9
Abidjan 8
Catania 8
Charlotte 8
Chennai 8
Haiphong 8
Karlsruhe 8
San Francisco 8
Santa Lucia Di Piave 8
Santiago 8
Shanghai 8
Auburn Hills 7
Baghdad 7
Da Nang 7
Holon 7
Kocaeli 7
Kuala Lumpur 7
Manchester 7
Totale 10.828
Salva come PNG Salva come JPEG
Nome #
A Diophantine representation of Wolstenholme's pseudoprimality 432
Proof verification within set theory 351
On Perfect Matchings for some Bipartite Graphs 314
Can a Single Equation Witness that every r.e. Set Admits a Finite-fold Diophantine Representation? 269
An environment for specifying properties of dyadic relations and reasoning about them. II: Relational presentation of non-classical logics. 249
Does every recursively enumerable set admit a finite-fold diophantine representation? 247
An equational re-engineering of set theories 244
Theory-specific automated reasoning 233
Reasoning on Relations, Modalities, and Sets 224
Banishing Ultrafilters from Our Consciousness 223
On the Diophantine complexity of the set of prime numbers 219
A `Theory' mechanism for a proof verifier based on first-order set theory 210
Reasoning about connectivity without paths 206
Decidability results for sets with atoms 205
A proof-checking experiment on representing graphs as membership digraphs 202
Set Graphs. V. On representing graphs as membership digraphs 201
A graphical representation of relational formulae with complementation 199
Three-variable statements of set-pairing 191
Polynomial-time satisfiability tests for boolean fragments of set theory 191
Preface to the Proceedings of the 34th Italian Conference on Computational Logic (CILC 2019) 190
The Representation of Boolean Algebras in the Spotlight of a Proof Checker 189
Formative processes with applications to the decision problem in set theory: I. Powerset and singleton operators 189
The Bernays-Schönfinkel-Ramsey class for set theory: semidecidability. 189
A computerized Referee 187
Computable Set Theory, vol. I 181
A derived algorithm for evaluating epsilon-expressions over abstract sets 181
Topological syllogistic with continuous and closed functions 180
The axiom of elementary sets on the edge of Peircean expressibility 178
Le radici forti dell'Informatica – L'intreccio storico tra tecnologia e fondamenti logici della matematica 175
Set Graphs. III. Proof Pearl: Claw-Free Graphs Mirrored into Transitive Hereditarily Finite Sets 174
An environment for specifying properties of dyadic relations and reasoning about them. I: Language extension mechanisms. 173
Hyper-Extensionality and One-Node Elimination on Membership Graphs 171
Decision procedures for elementary sublanguages of set theory. I: Multi-level syllogistic and some extensions 170
Solvable set/hyperset contexts: I. Some decision procedures for the pure, finite case 169
Automation of aggregate theories: The cornerstones of equational expressibility. 166
Rasiowa-Sikorski style Relational Elementary Set Theory 165
ER modelling from first relational principles 162
Decision procedures for elementary sublanguages of set theory. II: Formulas involving restricted quantifiers together with ordinal, integer, map, and domain notions 162
Decision algorithms for some fragments of analysis and related areas 162
Goals and benchmarks for automated map reasoning 161
The Linked Conjunct method for automatic deduction and related search techniques 161
Computational Logic and Set Theory -- Applying Formalized Logic to Analysis 160
Mapping Sets and Hypersets into Numbers 159
A graphical approach to relational reasoning 157
A language for programming in logic with finite sets 155
A Quadratic Reduction of Constraints over Nested Sets to Purely Boolean Formulae in CNF 152
{log}: A logic programming language with finite sets 150
Layered map reasoning: An experiment put to trial on sets 149
Compiling dyadic first-order specifications into map algebra 147
Notes from the logbook of a proof-checker's project 143
Bisimilarity, hypersets and stable partitioning: a survey 141
Decision procedures for elementary sublanguages of set theory, VII: Validity in set theory when a choice operator is present 139
The automation of syllogistic. II: Optimization and complexity issues 138
Decidability of E*A-sentences in membership theories 137
The quest for Diophantine finite-fold-ness 137
Statements of ill-founded infinity in Set Theory 136
A decidable theory involving addition of differentiable real functions 134
A Brief History of Singlefold Diophantine Definitions 134
Martin Davis’s Bibliography 1950–2015 132
Transitive Venn diagrams with applications to the decision problem in set theory 131
A Decidable Theory of Differentiable Functions with Convexities and Concavities on Real Intervals 130
Solvable set/hyperset contexts: II. A goal-driven algorithm for the blended case 129
Decision procedures for elementary sublanguages of set theory. VIII: A semidecision procedure for finite satisfiability of unquantified set-theoretic formulae 129
Three existence principles in a modal calculus without descriptions in A. Bressan's MC^nu 127
The elimination of descriptions from A. Bressan's modal language ML^nu on which the logical calculus MC^nu is based 124
Set Theory for Computing - From decision procedures to declarative programming with sets 123
The Ref Proof-Checker and Its “Common Shared Scenario” 119
null 118
Views on time in systems biology 116
The axiom of elementary sets. II: The edge of Peircean expressibility 116
Set-syllogistics meet combinatorics 116
The decidability of the Bernays-Shoenfinkel-Ramsey class for set theory 115
Complexity Assessments for Decidable Fragments of Set Theory. I: A Taxonomy for the Boolean Case 115
The Bernays-Schönfinkel-Ramsey class for set theory: decidability. 113
Infinity, in short. 113
Uniform relational frameworks for modal inferences 112
Using AEtnaNova to formally prove that the Davis-Putnam satisfiability test is correct 110
The automation of syllogistic. I: Syllogistic normal form 109
The axiom of elementary sets. I: Three-variable statements of set-pairing 108
A Decidable Theory Treating Addition of Differentiable Real Functions. 107
Two Crucial Cubic-Time Components of Polynomial-Maximal Decidable Boolean Languages. 107
Algebraic semantics of ER-models in the context of the calculus of relations. II: Dynamic view. 105
Preface 105
Some decidability issues concerning C^n real functions 100
On generalised Ackermann encodings – the basis issue 99
From Hilbert's 10th Problem to slim, Undecidable Fragments of Set Theory 99
Self-applied proof verification 96
A Sound and Complete Validity Test for Formulas in Extensional Multi-level Syllogistic 96
Solvable (and unsolvable) cases of the decision problem for fragments of analysis 94
On sets and graphs: Perspectives on logic and combinatorics 92
null 91
Complexity assessments for decidable fragments of set theory. II: A taxonomy for ‘small’ languages involving membership 90
Stating infinity in set/hyperset theories 89
Very Weak, Essentially Undecidabile Set Theories. 89
Cumulative hierarchies and computability over universes of sets. 87
Gerarchie cumulative e computabilità sopra universi d’insiemi 84
Continued Hereditarily Finite Set-Approximations 83
A parameterized family of decidable theories involving differentiable functions 74
Instructing equational set-reasoning with Otter 73
Complexity assessments for decidable fragments of Set Theory. III: Testers for crucial, polynomial-maximal decidable Boolean languages 69
Totale 15.347
Salva come PNG Salva come JPEG
Categoria #
all - tutte 46.581
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 46.581
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021134 0 0 0 0 0 0 0 0 0 0 0 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/20251.751 24 110 117 152 120 189 148 128 179 173 197 214
2025/20264.940 277 346 539 283 376 493 707 172 530 731 268 218
Totale 15.876