ArTS Archivio della ricerca di Trieste

OMODEO, EUGENIO
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 7.946
EU - Europa 4.224
AS - Asia 3.769
SA - Sud America 356
Continente sconosciuto - Info sul continente non disponibili 340
AF - Africa 71
OC - Oceania 15
Totale 16.721
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 7.822
SG - Singapore 1.407
PL - Polonia 937
IT - Italia 887
CN - Cina 832
SE - Svezia 537
UA - Ucraina 491
HK - Hong Kong 342
KR - Corea 313
BR - Brasile 270
VN - Vietnam 260
DE - Germania 238
FR - Francia 229
FI - Finlandia 198
GB - Regno Unito 189
TR - Turchia 177
BD - Bangladesh 173
RU - Federazione Russa 130
BG - Bulgaria 101
IE - Irlanda 95
CA - Canada 75
NL - Olanda 67
IN - India 49
JP - Giappone 32
CH - Svizzera 31
AR - Argentina 28
BE - Belgio 26
IQ - Iraq 24
MX - Messico 23
PK - Pakistan 19
ZA - Sudafrica 19
ID - Indonesia 18
SA - Arabia Saudita 15
CO - Colombia 14
ES - Italia 14
AT - Austria 13
AU - Australia 13
EC - Ecuador 13
MY - Malesia 13
IL - Israele 12
PH - Filippine 12
UZ - Uzbekistan 11
CL - Cile 10
MA - Marocco 10
RO - Romania 9
CI - Costa d'Avorio 8
IR - Iran 8
TH - Thailandia 8
DZ - Algeria 7
KE - Kenya 7
NP - Nepal 7
JO - Giordania 6
TN - Tunisia 6
UY - Uruguay 6
VE - Venezuela 6
BN - Brunei Darussalam 5
CR - Costa Rica 5
CZ - Repubblica Ceca 5
EG - Egitto 5
GR - Grecia 5
A1 - Anonimo 4
JM - Giamaica 4
OM - Oman 4
PY - Paraguay 4
SN - Senegal 4
TT - Trinidad e Tobago 4
AE - Emirati Arabi Uniti 3
AL - Albania 3
DO - Repubblica Dominicana 3
KZ - Kazakistan 3
LU - Lussemburgo 3
SV - El Salvador 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
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 16.374
Salva come PNG Salva come JPEG
Città #
Warsaw 834
Singapore 808
Ann Arbor 750
Woodbridge 731
Ashburn 624
Houston 522
San Jose 475
Jacksonville 444
Fairfield 441
Chandler 378
Hong Kong 336
Dallas 319
Seoul 310
Wilmington 297
Hefei 278
Council Bluffs 243
Trieste 232
Beijing 198
Seattle 195
Princeton 185
Boardman 177
Columbus 163
Cambridge 156
Izmir 146
Chicago 136
Sofia 100
Bremen 94
Zgierz 93
Dublin 92
Milan 92
Los Angeles 91
Moscow 89
Lauterbourg 86
Ho Chi Minh City 71
The Dalles 70
Santa Clara 59
Buffalo 57
Hanoi 57
New York 56
San Diego 38
Helsinki 33
Udine 32
Munich 31
Frankfurt am Main 29
Bern 27
Verona 27
Düsseldorf 26
London 23
Dong Ket 22
Montreal 21
Tokyo 21
Mestre 19
Rome 19
São Paulo 18
Toronto 18
Brooklyn 17
Brussels 17
Miano 17
Venice 16
Falls Church 15
San Francisco 15
Orem 13
Phoenix 13
Vicenza 13
Johannesburg 12
Redwood City 12
Tianjin 12
Turku 12
Amsterdam 11
Charlotte 11
Rio de Janeiro 11
Springfield 11
Atlanta 10
Boston 10
Denver 10
Des Moines 10
Dhaka 10
Guangzhou 10
Shenzhen 10
Catania 9
Chennai 9
Cividale del Friuli 9
Fremont 9
Lappeenranta 9
Nanjing 9
Naples 9
Norwalk 9
Nuremberg 9
Portogruaro 9
Redondo Beach 9
Santiago 9
Shanghai 9
Sora 9
Tashkent 9
Abidjan 8
Haiphong 8
Karlsruhe 8
Mumbai 8
Newark 8
Santa Lucia Di Piave 8
Totale 11.370
Salva come PNG Salva come JPEG
Nome #
A Diophantine representation of Wolstenholme's pseudoprimality 447
Proof verification within set theory 367
On Perfect Matchings for some Bipartite Graphs 324
Can a Single Equation Witness that every r.e. Set Admits a Finite-fold Diophantine Representation? 282
The Bernays-Schönfinkel-Ramsey class for set theory: semidecidability. 276
Does every recursively enumerable set admit a finite-fold diophantine representation? 261
An environment for specifying properties of dyadic relations and reasoning about them. II: Relational presentation of non-classical logics. 254
An equational re-engineering of set theories 251
Theory-specific automated reasoning 244
Reasoning on Relations, Modalities, and Sets 230
On the Diophantine complexity of the set of prime numbers 227
Banishing Ultrafilters from Our Consciousness 226
Reasoning about connectivity without paths 217
A `Theory' mechanism for a proof verifier based on first-order set theory 217
A proof-checking experiment on representing graphs as membership digraphs 212
Decidability results for sets with atoms 209
A graphical representation of relational formulae with complementation 206
Set Graphs. V. On representing graphs as membership digraphs 203
Preface to the Proceedings of the 34th Italian Conference on Computational Logic (CILC 2019) 201
Polynomial-time satisfiability tests for boolean fragments of set theory 199
The Representation of Boolean Algebras in the Spotlight of a Proof Checker 198
Formative processes with applications to the decision problem in set theory: I. Powerset and singleton operators 197
Three-variable statements of set-pairing 195
A computerized Referee 192
Le radici forti dell'Informatica – L'intreccio storico tra tecnologia e fondamenti logici della matematica 189
A derived algorithm for evaluating epsilon-expressions over abstract sets 188
Computable Set Theory, vol. I 185
Topological syllogistic with continuous and closed functions 185
The axiom of elementary sets on the edge of Peircean expressibility 184
Set Graphs. III. Proof Pearl: Claw-Free Graphs Mirrored into Transitive Hereditarily Finite Sets 182
Solvable set/hyperset contexts: I. Some decision procedures for the pure, finite case 179
Hyper-Extensionality and One-Node Elimination on Membership Graphs 179
An environment for specifying properties of dyadic relations and reasoning about them. I: Language extension mechanisms. 177
Decision procedures for elementary sublanguages of set theory. I: Multi-level syllogistic and some extensions 176
Automation of aggregate theories: The cornerstones of equational expressibility. 172
ER modelling from first relational principles 170
Decision algorithms for some fragments of analysis and related areas 169
Rasiowa-Sikorski style Relational Elementary Set Theory 169
Goals and benchmarks for automated map reasoning 168
Decision procedures for elementary sublanguages of set theory. II: Formulas involving restricted quantifiers together with ordinal, integer, map, and domain notions 168
Computational Logic and Set Theory -- Applying Formalized Logic to Analysis 168
A graphical approach to relational reasoning 166
The Linked Conjunct method for automatic deduction and related search techniques 165
Mapping Sets and Hypersets into Numbers 164
A language for programming in logic with finite sets 160
A Quadratic Reduction of Constraints over Nested Sets to Purely Boolean Formulae in CNF 159
Compiling dyadic first-order specifications into map algebra 156
Layered map reasoning: An experiment put to trial on sets 155
{log}: A logic programming language with finite sets 152
Notes from the logbook of a proof-checker's project 148
The automation of syllogistic. II: Optimization and complexity issues 145
A decidable theory involving addition of differentiable real functions 143
Bisimilarity, hypersets and stable partitioning: a survey 143
The quest for Diophantine finite-fold-ness 143
Decision procedures for elementary sublanguages of set theory, VII: Validity in set theory when a choice operator is present 142
Statements of ill-founded infinity in Set Theory 141
A Brief History of Singlefold Diophantine Definitions 141
Decidability of E*A-sentences in membership theories 140
Solvable set/hyperset contexts: II. A goal-driven algorithm for the blended case 138
Transitive Venn diagrams with applications to the decision problem in set theory 136
Three existence principles in a modal calculus without descriptions in A. Bressan's MC^nu 135
Martin Davis’s Bibliography 1950–2015 135
A Decidable Theory of Differentiable Functions with Convexities and Concavities on Real Intervals 135
Set Theory for Computing - From decision procedures to declarative programming with sets 134
Decision procedures for elementary sublanguages of set theory. VIII: A semidecision procedure for finite satisfiability of unquantified set-theoretic formulae 134
The elimination of descriptions from A. Bressan's modal language ML^nu on which the logical calculus MC^nu is based 132
Set-syllogistics meet combinatorics 129
Views on time in systems biology 123
The Ref Proof-Checker and Its “Common Shared Scenario” 121
The axiom of elementary sets. II: The edge of Peircean expressibility 121
Complexity Assessments for Decidable Fragments of Set Theory. I: A Taxonomy for the Boolean Case 119
The decidability of the Bernays-Shoenfinkel-Ramsey class for set theory 118
null 118
Uniform relational frameworks for modal inferences 117
Using AEtnaNova to formally prove that the Davis-Putnam satisfiability test is correct 116
Infinity, in short. 116
Two Crucial Cubic-Time Components of Polynomial-Maximal Decidable Boolean Languages. 116
Algebraic semantics of ER-models in the context of the calculus of relations. II: Dynamic view. 115
The Bernays-Schönfinkel-Ramsey class for set theory: decidability. 114
The automation of syllogistic. I: Syllogistic normal form 113
The axiom of elementary sets. I: Three-variable statements of set-pairing 113
A Decidable Theory Treating Addition of Differentiable Real Functions. 112
Some decidability issues concerning C^n real functions 111
On generalised Ackermann encodings – the basis issue 108
Preface 107
From Hilbert's 10th Problem to slim, Undecidable Fragments of Set Theory 106
Self-applied proof verification 104
On sets and graphs: Perspectives on logic and combinatorics 102
Solvable (and unsolvable) cases of the decision problem for fragments of analysis 101
Complexity assessments for decidable fragments of set theory. II: A taxonomy for ‘small’ languages involving membership 101
Very Weak, Essentially Undecidabile Set Theories. 98
A Sound and Complete Validity Test for Formulas in Extensional Multi-level Syllogistic 97
Stating infinity in set/hyperset theories 95
Cumulative hierarchies and computability over universes of sets. 95
null 91
Continued Hereditarily Finite Set-Approximations 89
Gerarchie cumulative e computabilità sopra universi d’insiemi 89
ON DIOPHANTINE SINGLEFOLD SPECIFICATIONS 79
A parameterized family of decidable theories involving differentiable functions 79
Reconciling transparency, low Δ0-complexity and axiomatic weakness in undecidability proofs 78
Totale 16.096
Salva come PNG Salva come JPEG
Categoria #
all - tutte 49.905
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 49.905
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2021/2022775 0 0 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.947 277 346 539 283 376 493 707 172 530 731 268 225
2026/2027838 281 275 282 0 0 0 0 0 0 0 0 0
Totale 16.721