ArTS Archivio della ricerca di Trieste

OMODEO, EUGENIO
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 6.089
EU - Europa 3.703
AS - Asia 2.438
SA - Sud America 263
AF - Africa 38
OC - Oceania 7
Continente sconosciuto - Info sul continente non disponibili 5
Totale 12.543
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 6.034
SG - Singapore 921
PL - Polonia 843
IT - Italia 699
CN - Cina 685
SE - Svezia 533
UA - Ucraina 487
HK - Hong Kong 323
BR - Brasile 223
DE - Germania 218
FI - Finlandia 179
GB - Regno Unito 171
TR - Turchia 165
KR - Corea 127
RU - Federazione Russa 126
BG - Bulgaria 100
FR - Francia 94
IE - Irlanda 91
NL - Olanda 59
VN - Vietnam 52
CA - Canada 35
CH - Svizzera 31
IN - India 29
BE - Belgio 24
JP - Giappone 21
AR - Argentina 15
BD - Bangladesh 15
ZA - Sudafrica 14
IQ - Iraq 13
AT - Austria 12
MX - Messico 12
ES - Italia 11
ID - Indonesia 9
IL - Israele 9
MY - Malesia 9
IR - Iran 8
EC - Ecuador 7
PK - Pakistan 7
RO - Romania 7
UZ - Uzbekistan 7
AU - Australia 6
CI - Costa d'Avorio 6
PH - Filippine 6
TH - Thailandia 6
BN - Brunei Darussalam 5
MA - Marocco 5
SA - Arabia Saudita 5
A1 - Anonimo 4
CO - Colombia 4
GR - Grecia 4
KE - Kenya 4
AE - Emirati Arabi Uniti 3
AL - Albania 3
CZ - Repubblica Ceca 3
DO - Repubblica Dominicana 3
LU - Lussemburgo 3
NP - Nepal 3
PY - Paraguay 3
SN - Senegal 3
UY - Uruguay 3
VE - Venezuela 3
CL - Cile 2
DZ - Algeria 2
KZ - Kazakistan 2
OM - Oman 2
AM - Armenia 1
AZ - Azerbaigian 1
CR - Costa Rica 1
DK - Danimarca 1
EE - Estonia 1
EG - Egitto 1
GE - Georgia 1
GY - Guiana 1
HN - Honduras 1
HU - Ungheria 1
JM - Giamaica 1
JO - Giordania 1
KG - Kirghizistan 1
LT - Lituania 1
LY - Libia 1
NG - Nigeria 1
NZ - Nuova Zelanda 1
PA - Panama 1
PE - Perù 1
PS - Palestinian Territory 1
RS - Serbia 1
SR - Suriname 1
TN - Tunisia 1
TT - Trinidad e Tobago 1
XK - ???statistics.table.value.countryCode.XK??? 1
Totale 12.543
Salva come PNG Salva come JPEG
Città #
Warsaw 834
Ann Arbor 750
Woodbridge 731
Houston 520
Singapore 463
Fairfield 440
Jacksonville 438
Chandler 377
Ashburn 331
Hong Kong 320
Dallas 300
Wilmington 295
Hefei 277
Trieste 220
Seattle 188
Princeton 180
Boardman 175
Beijing 171
Cambridge 155
Izmir 146
Seoul 126
Sofia 100
Columbus 96
Bremen 94
Dublin 89
Moscow 88
Los Angeles 64
Buffalo 50
Milan 46
San Diego 38
The Dalles 38
Santa Clara 37
Udine 32
Munich 30
Bern 27
Düsseldorf 26
Verona 26
Chicago 25
Dong Ket 22
Frankfurt am Main 19
London 19
Mestre 19
Helsinki 17
Brussels 16
Falls Church 15
New York 15
São Paulo 15
Tokyo 15
Brooklyn 12
Redwood City 12
Turku 12
Venice 12
Vicenza 12
Council Bluffs 10
Montreal 10
Toronto 10
Cividale del Friuli 9
Fremont 9
Ho Chi Minh City 9
Johannesburg 9
Nanjing 9
Norwalk 9
Portogruaro 9
Redondo Beach 9
Amsterdam 8
Boston 8
Des Moines 8
Karlsruhe 8
San Francisco 8
Santa Lucia Di Piave 8
Tianjin 8
Auburn Hills 7
Holon 7
Kocaeli 7
Nuremberg 7
Redmond 7
Shanghai 7
Abidjan 6
Atlanta 6
Guangzhou 6
Kunming 6
Lappeenranta 6
Mumbai 6
Rio de Janeiro 6
Rome 6
Baghdad 5
Bandar Seri Begawan 5
Catania 5
Chennai 5
Dubino 5
Indiana 5
Kuala Lumpur 5
Phoenix 5
Portsmouth 5
Tashkent 5
Ankara 4
Bognor Regis 4
Bolzano 4
Brasília 4
Charlotte 4
Totale 8.893
Salva come PNG Salva come JPEG
Nome #
A Diophantine representation of Wolstenholme's pseudoprimality 364
Proof verification within set theory 313
On Perfect Matchings for some Bipartite Graphs 271
Can a Single Equation Witness that every r.e. Set Admits a Finite-fold Diophantine Representation? 225
An equational re-engineering of set theories 215
An environment for specifying properties of dyadic relations and reasoning about them. II: Relational presentation of non-classical logics. 205
Theory-specific automated reasoning 204
Banishing Ultrafilters from Our Consciousness 198
Does every recursively enumerable set admit a finite-fold diophantine representation? 195
Reasoning on Relations, Modalities, and Sets 194
On the Diophantine complexity of the set of prime numbers 186
A `Theory' mechanism for a proof verifier based on first-order set theory 183
Decidability results for sets with atoms 183
Reasoning about connectivity without paths 177
A graphical representation of relational formulae with complementation 170
Three-variable statements of set-pairing 169
A proof-checking experiment on representing graphs as membership digraphs 165
Preface to the Proceedings of the 34th Italian Conference on Computational Logic (CILC 2019) 164
Computable Set Theory, vol. I 163
Topological syllogistic with continuous and closed functions 162
The axiom of elementary sets on the edge of Peircean expressibility 160
Set Graphs. V. On representing graphs as membership digraphs 160
A computerized Referee 158
An environment for specifying properties of dyadic relations and reasoning about them. I: Language extension mechanisms. 153
Polynomial-time satisfiability tests for boolean fragments of set theory 153
Hyper-Extensionality and One-Node Elimination on Membership Graphs 151
Formative processes with applications to the decision problem in set theory: I. Powerset and singleton operators 150
Decision procedures for elementary sublanguages of set theory. I: Multi-level syllogistic and some extensions 150
A derived algorithm for evaluating epsilon-expressions over abstract sets 148
The Representation of Boolean Algebras in the Spotlight of a Proof Checker 147
Rasiowa-Sikorski style Relational Elementary Set Theory 147
Decision procedures for elementary sublanguages of set theory. II: Formulas involving restricted quantifiers together with ordinal, integer, map, and domain notions 145
Le radici forti dell'Informatica – L'intreccio storico tra tecnologia e fondamenti logici della matematica 144
Set Graphs. III. Proof Pearl: Claw-Free Graphs Mirrored into Transitive Hereditarily Finite Sets 143
Solvable set/hyperset contexts: I. Some decision procedures for the pure, finite case 140
Automation of aggregate theories: The cornerstones of equational expressibility. 140
The Linked Conjunct method for automatic deduction and related search techniques 139
Goals and benchmarks for automated map reasoning 137
ER modelling from first relational principles 137
Decision algorithms for some fragments of analysis and related areas 134
A graphical approach to relational reasoning 131
Computational Logic and Set Theory -- Applying Formalized Logic to Analysis 130
Mapping Sets and Hypersets into Numbers 128
Notes from the logbook of a proof-checker's project 126
Layered map reasoning: An experiment put to trial on sets 125
Bisimilarity, hypersets and stable partitioning: a survey 121
A language for programming in logic with finite sets 119
Compiling dyadic first-order specifications into map algebra 119
Statements of ill-founded infinity in Set Theory 119
null 118
Decidability of E*A-sentences in membership theories 117
The automation of syllogistic. II: Optimization and complexity issues 116
Decision procedures for elementary sublanguages of set theory, VII: Validity in set theory when a choice operator is present 115
Transitive Venn diagrams with applications to the decision problem in set theory 114
Decision procedures for elementary sublanguages of set theory. VIII: A semidecision procedure for finite satisfiability of unquantified set-theoretic formulae 113
Martin Davis’s Bibliography 1950–2015 112
{log}: A logic programming language with finite sets 111
The elimination of descriptions from A. Bressan's modal language ML^nu on which the logical calculus MC^nu is based 108
Solvable set/hyperset contexts: II. A goal-driven algorithm for the blended case 107
Three existence principles in a modal calculus without descriptions in A. Bressan's MC^nu 106
Set Theory for Computing - From decision procedures to declarative programming with sets 104
The Ref Proof-Checker and Its “Common Shared Scenario” 104
A Quadratic Reduction of Constraints over Nested Sets to Purely Boolean Formulae in CNF 104
A Brief History of Singlefold Diophantine Definitions 102
Infinity, in short. 100
Views on time in systems biology 99
A Decidable Theory of Differentiable Functions with Convexities and Concavities on Real Intervals 98
The automation of syllogistic. I: Syllogistic normal form 97
The Bernays-Schönfinkel-Ramsey class for set theory: semidecidability. 97
The Bernays-Schönfinkel-Ramsey class for set theory: decidability. 96
Using AEtnaNova to formally prove that the Davis-Putnam satisfiability test is correct 94
The axiom of elementary sets. II: The edge of Peircean expressibility 93
The decidability of the Bernays-Shoenfinkel-Ramsey class for set theory 92
null 91
The quest for Diophantine finite-fold-ness 89
A decidable theory involving addition of differentiable real functions 85
Uniform relational frameworks for modal inferences 84
The axiom of elementary sets. I: Three-variable statements of set-pairing 84
Self-applied proof verification 84
Preface 84
Complexity Assessments for Decidable Fragments of Set Theory. I: A Taxonomy for the Boolean Case 82
Set-syllogistics meet combinatorics 79
A Decidable Theory Treating Addition of Differentiable Real Functions. 77
Algebraic semantics of ER-models in the context of the calculus of relations. II: Dynamic view. 75
From Hilbert's 10th Problem to slim, Undecidable Fragments of Set Theory 72
Two Crucial Cubic-Time Components of Polynomial-Maximal Decidable Boolean Languages. 70
A Sound and Complete Validity Test for Formulas in Extensional Multi-level Syllogistic 70
Stating infinity in set/hyperset theories 68
Some decidability issues concerning C^n real functions 66
Solvable (and unsolvable) cases of the decision problem for fragments of analysis 65
Complexity assessments for decidable fragments of set theory. II: A taxonomy for ‘small’ languages involving membership 65
On generalised Ackermann encodings – the basis issue 63
null 63
Cumulative hierarchies and computability over universes of sets. 63
Very Weak, Essentially Undecidabile Set Theories. 62
Gerarchie cumulative e computabilità sopra universi d’insiemi 61
On sets and graphs: Perspectives on logic and combinatorics 61
Continued Hereditarily Finite Set-Approximations 57
Instructing equational set-reasoning with Otter 49
Reconciling transparency, low Δ0-complexity and axiomatic weakness in undecidability proofs 46
Totale 12.592
Salva come PNG Salva come JPEG
Categoria #
all - tutte 39.376
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 39.376
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021707 0 0 0 0 0 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/20251.751 24 110 117 152 120 189 148 128 179 173 197 214
2025/20261.927 277 346 539 283 376 106 0 0 0 0 0 0
Totale 12.863