ArTS Archivio della ricerca di Trieste

OMODEO, EUGENIO
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 6.972
EU - Europa 4.059
AS - Asia 3.582
SA - Sud America 338
AF - Africa 71
OC - Oceania 13
Continente sconosciuto - Info sul continente non disponibili 5
Totale 15.040
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 6.887
SG - Singapore 1.391
PL - Polonia 937
CN - Cina 813
IT - Italia 735
SE - Svezia 536
UA - Ucraina 491
HK - Hong Kong 336
KR - Corea 312
BR - Brasile 261
VN - Vietnam 258
DE - Germania 237
FR - Francia 228
FI - Finlandia 198
GB - Regno Unito 187
TR - Turchia 177
RU - Federazione Russa 130
BG - Bulgaria 101
IE - Irlanda 94
NL - Olanda 64
CA - Canada 50
IN - India 47
BD - Bangladesh 35
CH - Svizzera 31
JP - Giappone 31
AR - Argentina 26
BE - Belgio 24
IQ - Iraq 24
MX - Messico 19
PK - Pakistan 19
ZA - Sudafrica 19
ID - Indonesia 17
SA - Arabia Saudita 15
ES - Italia 14
AT - Austria 13
EC - Ecuador 12
IL - Israele 12
MY - Malesia 12
PH - Filippine 12
AU - Australia 11
UZ - Uzbekistan 11
CO - Colombia 10
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
OM - Oman 4
PY - Paraguay 4
SN - Senegal 4
AE - Emirati Arabi Uniti 3
AL - Albania 3
DO - Repubblica Dominicana 3
JM - Giamaica 3
KZ - Kazakistan 3
LU - Lussemburgo 3
AM - Armenia 2
AZ - Azerbaigian 2
BH - Bahrain 2
CR - Costa Rica 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
TT - Trinidad e Tobago 2
AF - Afghanistan, Repubblica islamica di 1
BB - Barbados 1
BO - Bolivia 1
BS - Bahamas 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
LK - Sri Lanka 1
LY - Libia 1
Totale 15.029
Salva come PNG Salva come JPEG
Città #
Warsaw 834
Singapore 802
Ann Arbor 750
Woodbridge 731
Houston 520
Ashburn 467
Fairfield 440
Jacksonville 439
San Jose 409
Chandler 377
Hong Kong 330
Seoul 310
Dallas 304
Wilmington 297
Hefei 278
Trieste 223
Beijing 190
Seattle 189
Princeton 180
Boardman 176
Cambridge 155
Izmir 146
Chicago 125
Sofia 100
Columbus 97
Bremen 94
Zgierz 93
Dublin 91
Moscow 89
Lauterbourg 86
Los Angeles 76
Ho Chi Minh City 69
The Dalles 69
Milan 58
Hanoi 57
Council Bluffs 55
Buffalo 52
Santa Clara 45
San Diego 38
Helsinki 33
Udine 32
Munich 30
Frankfurt am Main 29
Bern 27
Düsseldorf 26
Verona 26
New York 23
Dong Ket 22
London 21
Tokyo 21
Mestre 19
São Paulo 18
Brussels 16
Falls Church 15
Montreal 15
Toronto 13
Brooklyn 12
Johannesburg 12
Orem 12
Redwood City 12
Tianjin 12
Turku 12
Venice 12
Vicenza 12
Amsterdam 11
Dhaka 10
Guangzhou 10
Rio de Janeiro 10
Shenzhen 10
Atlanta 9
Boston 9
Cividale del Friuli 9
Des Moines 9
Fremont 9
Lappeenranta 9
Nanjing 9
Norwalk 9
Nuremberg 9
Portogruaro 9
Redondo Beach 9
Tashkent 9
Abidjan 8
Chennai 8
Haiphong 8
Karlsruhe 8
San Francisco 8
Santa Lucia Di Piave 8
Santiago 8
Shanghai 8
Auburn Hills 7
Baghdad 7
Catania 7
Da Nang 7
Holon 7
Kocaeli 7
Manchester 7
Mumbai 7
Redmond 7
Riyadh 7
Rome 7
Totale 10.623
Salva come PNG Salva come JPEG
Nome #
A Diophantine representation of Wolstenholme's pseudoprimality 404
Proof verification within set theory 346
On Perfect Matchings for some Bipartite Graphs 303
Can a Single Equation Witness that every r.e. Set Admits a Finite-fold Diophantine Representation? 264
An equational re-engineering of set theories 243
An environment for specifying properties of dyadic relations and reasoning about them. II: Relational presentation of non-classical logics. 236
Theory-specific automated reasoning 231
Does every recursively enumerable set admit a finite-fold diophantine representation? 228
Reasoning on Relations, Modalities, and Sets 218
On the Diophantine complexity of the set of prime numbers 216
Banishing Ultrafilters from Our Consciousness 215
A `Theory' mechanism for a proof verifier based on first-order set theory 206
Decidability results for sets with atoms 203
A proof-checking experiment on representing graphs as membership digraphs 200
Reasoning about connectivity without paths 197
A graphical representation of relational formulae with complementation 194
Three-variable statements of set-pairing 190
Formative processes with applications to the decision problem in set theory: I. Powerset and singleton operators 188
Preface to the Proceedings of the 34th Italian Conference on Computational Logic (CILC 2019) 187
The Representation of Boolean Algebras in the Spotlight of a Proof Checker 186
Set Graphs. V. On representing graphs as membership digraphs 186
A computerized Referee 185
Polynomial-time satisfiability tests for boolean fragments of set theory 183
A derived algorithm for evaluating epsilon-expressions over abstract sets 180
Computable Set Theory, vol. I 179
Topological syllogistic with continuous and closed functions 179
The axiom of elementary sets on the edge of Peircean expressibility 178
An environment for specifying properties of dyadic relations and reasoning about them. I: Language extension mechanisms. 173
Solvable set/hyperset contexts: I. Some decision procedures for the pure, finite case 169
Decision procedures for elementary sublanguages of set theory. I: Multi-level syllogistic and some extensions 169
Le radici forti dell'Informatica – L'intreccio storico tra tecnologia e fondamenti logici della matematica 168
Hyper-Extensionality and One-Node Elimination on Membership Graphs 168
Rasiowa-Sikorski style Relational Elementary Set Theory 165
Automation of aggregate theories: The cornerstones of equational expressibility. 165
Decision procedures for elementary sublanguages of set theory. II: Formulas involving restricted quantifiers together with ordinal, integer, map, and domain notions 162
Goals and benchmarks for automated map reasoning 161
ER modelling from first relational principles 161
Decision algorithms for some fragments of analysis and related areas 161
The Linked Conjunct method for automatic deduction and related search techniques 160
Set Graphs. III. Proof Pearl: Claw-Free Graphs Mirrored into Transitive Hereditarily Finite Sets 160
A graphical approach to relational reasoning 157
Computational Logic and Set Theory -- Applying Formalized Logic to Analysis 157
A language for programming in logic with finite sets 153
Mapping Sets and Hypersets into Numbers 152
Layered map reasoning: An experiment put to trial on sets 149
{log}: A logic programming language with finite sets 148
Compiling dyadic first-order specifications into map algebra 145
Notes from the logbook of a proof-checker's project 142
A Quadratic Reduction of Constraints over Nested Sets to Purely Boolean Formulae in CNF 141
Bisimilarity, hypersets and stable partitioning: a survey 140
Decidability of E*A-sentences in membership theories 136
The automation of syllogistic. II: Optimization and complexity issues 136
Decision procedures for elementary sublanguages of set theory, VII: Validity in set theory when a choice operator is present 136
Statements of ill-founded infinity in Set Theory 136
Transitive Venn diagrams with applications to the decision problem in set theory 131
A Brief History of Singlefold Diophantine Definitions 130
A decidable theory involving addition of differentiable real functions 129
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
Martin Davis’s Bibliography 1950–2015 129
The quest for Diophantine finite-fold-ness 128
A Decidable Theory of Differentiable Functions with Convexities and Concavities on Real Intervals 127
Three existence principles in a modal calculus without descriptions in A. Bressan's MC^nu 126
Set Theory for Computing - From decision procedures to declarative programming with sets 123
The elimination of descriptions from A. Bressan's modal language ML^nu on which the logical calculus MC^nu is based 123
The Bernays-Schönfinkel-Ramsey class for set theory: semidecidability. 122
null 118
Views on time in systems biology 115
The Ref Proof-Checker and Its “Common Shared Scenario” 115
The axiom of elementary sets. II: The edge of Peircean expressibility 115
The decidability of the Bernays-Shoenfinkel-Ramsey class for set theory 113
Complexity Assessments for Decidable Fragments of Set Theory. I: A Taxonomy for the Boolean Case 112
Uniform relational frameworks for modal inferences 111
Infinity, in short. 111
Using AEtnaNova to formally prove that the Davis-Putnam satisfiability test is correct 110
The Bernays-Schönfinkel-Ramsey class for set theory: decidability. 110
The automation of syllogistic. I: Syllogistic normal form 109
The axiom of elementary sets. I: Three-variable statements of set-pairing 108
Set-syllogistics meet combinatorics 106
Algebraic semantics of ER-models in the context of the calculus of relations. II: Dynamic view. 104
Preface 104
A Decidable Theory Treating Addition of Differentiable Real Functions. 102
Self-applied proof verification 96
On generalised Ackermann encodings – the basis issue 95
From Hilbert's 10th Problem to slim, Undecidable Fragments of Set Theory 94
null 91
Two Crucial Cubic-Time Components of Polynomial-Maximal Decidable Boolean Languages. 90
Some decidability issues concerning C^n real functions 89
On sets and graphs: Perspectives on logic and combinatorics 88
Solvable (and unsolvable) cases of the decision problem for fragments of analysis 87
A Sound and Complete Validity Test for Formulas in Extensional Multi-level Syllogistic 87
Cumulative hierarchies and computability over universes of sets. 86
Complexity assessments for decidable fragments of set theory. II: A taxonomy for ‘small’ languages involving membership 85
Gerarchie cumulative e computabilità sopra universi d’insiemi 82
Very Weak, Essentially Undecidabile Set Theories. 82
Continued Hereditarily Finite Set-Approximations 81
Stating infinity in set/hyperset theories 80
Reconciling transparency, low Δ0-complexity and axiomatic weakness in undecidability proofs 69
Instructing equational set-reasoning with Otter 69
Complexity assessments for decidable fragments of Set Theory. III: Testers for crucial, polynomial-maximal decidable Boolean languages 68
Totale 14.903
Salva come PNG Salva come JPEG
Categoria #
all - tutte 43.688
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 43.688
Salva come PNG Salva come JPEG


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