ArTS Archivio della ricerca di Trieste

OMODEO, EUGENIO
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 5.359
EU - Europa 3.423
AS - Asia 1.206
SA - Sud America 62
AF - Africa 17
OC - Oceania 6
Continente sconosciuto - Info sul continente non disponibili 5
Totale 10.078
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 5.340
PL - Polonia 817
IT - Italia 673
SE - Svezia 529
UA - Ucraina 485
SG - Singapore 382
HK - Hong Kong 304
CN - Cina 265
FI - Finlandia 163
DE - Germania 156
TR - Turchia 156
GB - Regno Unito 125
RU - Federazione Russa 117
BG - Bulgaria 100
IE - Irlanda 91
FR - Francia 67
BR - Brasile 57
CH - Svizzera 31
VN - Vietnam 22
BE - Belgio 21
CA - Canada 16
NL - Olanda 15
IN - India 13
AT - Austria 11
JP - Giappone 11
IL - Israele 9
CI - Costa d'Avorio 6
IR - Iran 6
RO - Romania 6
AU - Australia 5
BN - Brunei Darussalam 5
MY - Malesia 5
A1 - Anonimo 4
BD - Bangladesh 4
ES - Italia 4
TH - Thailandia 4
CZ - Repubblica Ceca 3
GR - Grecia 3
ID - Indonesia 3
LU - Lussemburgo 3
PK - Pakistan 3
SN - Senegal 3
CO - Colombia 2
DZ - Algeria 2
IQ - Iraq 2
KZ - Kazakistan 2
NP - Nepal 2
UZ - Uzbekistan 2
ZA - Sudafrica 2
AM - Armenia 1
AR - Argentina 1
CR - Costa Rica 1
DK - Danimarca 1
DO - Repubblica Dominicana 1
EE - Estonia 1
GE - Georgia 1
HU - Ungheria 1
KE - Kenya 1
KG - Kirghizistan 1
KR - Corea 1
LY - Libia 1
MA - Marocco 1
MX - Messico 1
NG - Nigeria 1
NZ - Nuova Zelanda 1
OM - Oman 1
PE - Perù 1
SA - Arabia Saudita 1
VE - Venezuela 1
XK - ???statistics.table.value.countryCode.XK??? 1
Totale 10.078
Salva come PNG Salva come JPEG
Città #
Warsaw 811
Ann Arbor 750
Woodbridge 731
Houston 519
Fairfield 440
Jacksonville 438
Chandler 377
Hong Kong 303
Wilmington 294
Ashburn 242
Trieste 218
Seattle 183
Princeton 180
Singapore 178
Boardman 175
Cambridge 155
Izmir 146
Beijing 117
Sofia 100
Columbus 96
Bremen 94
Dublin 89
Moscow 85
Milan 41
San Diego 38
Udine 32
The Dalles 31
Santa Clara 29
Bern 27
Verona 26
Dong Ket 22
Chicago 20
Mestre 19
Helsinki 17
Falls Church 15
Los Angeles 15
Brussels 13
Düsseldorf 13
Redwood City 12
Vicenza 12
Cividale del Friuli 9
Fremont 9
Nanjing 9
Norwalk 9
Portogruaro 9
Buffalo 8
Des Moines 8
Karlsruhe 8
Santa Lucia Di Piave 8
Auburn Hills 7
Holon 7
Kocaeli 7
London 7
Redmond 7
Shanghai 7
Toronto 7
Venice 7
Abidjan 6
Hefei 6
Kunming 6
Nuremberg 6
Rome 6
Tokyo 6
Amsterdam 5
Bandar Seri Begawan 5
Catania 5
Dubino 5
Indiana 5
Mumbai 5
Bognor Regis 4
Bolzano 4
Dearborn 4
Fano 4
Guangzhou 4
Kraków 4
Ottawa 4
Porto Recanati 4
Riverside 4
São Paulo 4
Ancona 3
Bologna 3
Changsha 3
Cutrofiano 3
Dakar 3
Dallas 3
Hebei 3
Mountain View 3
Munich 3
Phoenix 3
Pordenone 3
Quanzhou 3
Rochester 3
Scottsdale 3
Shenyang 3
Siziano 3
Tavagnacco 3
Vienna 3
Azor 2
Bellaterra 2
Berlin 2
Totale 7.402
Salva come PNG Salva come JPEG
Nome #
A Diophantine representation of Wolstenholme's pseudoprimality 331
Proof verification within set theory 293
On Perfect Matchings for some Bipartite Graphs 243
Can a Single Equation Witness that every r.e. Set Admits a Finite-fold Diophantine Representation? 209
Theory-specific automated reasoning 189
Reasoning on Relations, Modalities, and Sets 184
Banishing Ultrafilters from Our Consciousness 178
Decidability results for sets with atoms 172
On the Diophantine complexity of the set of prime numbers 171
An environment for specifying properties of dyadic relations and reasoning about them. II: Relational presentation of non-classical logics. 165
An equational re-engineering of set theories 164
Reasoning about connectivity without paths 154
Preface to the Proceedings of the 34th Italian Conference on Computational Logic (CILC 2019) 153
Three-variable statements of set-pairing 149
Does every recursively enumerable set admit a finite-fold diophantine representation? 149
Set Graphs. V. On representing graphs as membership digraphs 144
The axiom of elementary sets on the edge of Peircean expressibility 139
Polynomial-time satisfiability tests for boolean fragments of set theory 139
Hyper-Extensionality and One-Node Elimination on Membership Graphs 137
A `Theory' mechanism for a proof verifier based on first-order set theory 136
Topological syllogistic with continuous and closed functions 136
Computable Set Theory, vol. I 135
Set Graphs. III. Proof Pearl: Claw-Free Graphs Mirrored into Transitive Hereditarily Finite Sets 134
Rasiowa-Sikorski style Relational Elementary Set Theory 128
A proof-checking experiment on representing graphs as membership digraphs 128
Decision procedures for elementary sublanguages of set theory. I: Multi-level syllogistic and some extensions 126
A graphical representation of relational formulae with complementation 124
ER modelling from first relational principles 123
The Representation of Boolean Algebras in the Spotlight of a Proof Checker 121
Formative processes with applications to the decision problem in set theory: I. Powerset and singleton operators 121
Decision procedures for elementary sublanguages of set theory. II: Formulas involving restricted quantifiers together with ordinal, integer, map, and domain notions 120
Mapping Sets and Hypersets into Numbers 119
Le radici forti dell'Informatica – L'intreccio storico tra tecnologia e fondamenti logici della matematica 118
null 118
Goals and benchmarks for automated map reasoning 117
Solvable set/hyperset contexts: I. Some decision procedures for the pure, finite case 116
Computational Logic and Set Theory -- Applying Formalized Logic to Analysis 115
A computerized Referee 114
The Linked Conjunct method for automatic deduction and related search techniques 114
An environment for specifying properties of dyadic relations and reasoning about them. I: Language extension mechanisms. 112
Notes from the logbook of a proof-checker's project 107
Decision algorithms for some fragments of analysis and related areas 107
Layered map reasoning: An experiment put to trial on sets 105
Bisimilarity, hypersets and stable partitioning: a survey 105
Compiling dyadic first-order specifications into map algebra 100
Martin Davis’s Bibliography 1950–2015 100
A derived algorithm for evaluating epsilon-expressions over abstract sets 99
Statements of ill-founded infinity in Set Theory 97
Automation of aggregate theories: The cornerstones of equational expressibility. 96
The Ref Proof-Checker and Its “Common Shared Scenario” 96
Decidability of E*A-sentences in membership theories 94
null 91
Decision procedures for elementary sublanguages of set theory, VII: Validity in set theory when a choice operator is present 91
Transitive Venn diagrams with applications to the decision problem in set theory 91
The automation of syllogistic. II: Optimization and complexity issues 90
A graphical approach to relational reasoning 90
Infinity, in short. 90
Decision procedures for elementary sublanguages of set theory. VIII: A semidecision procedure for finite satisfiability of unquantified set-theoretic formulae 88
{log}: A logic programming language with finite sets 88
Three existence principles in a modal calculus without descriptions in A. Bressan's MC^nu 86
Set Theory for Computing - From decision procedures to declarative programming with sets 85
The Bernays-Schönfinkel-Ramsey class for set theory: decidability. 84
The elimination of descriptions from A. Bressan's modal language ML^nu on which the logical calculus MC^nu is based 83
The axiom of elementary sets. II: The edge of Peircean expressibility 83
Views on time in systems biology 82
Solvable set/hyperset contexts: II. A goal-driven algorithm for the blended case 79
The Bernays-Schönfinkel-Ramsey class for set theory: semidecidability. 79
A language for programming in logic with finite sets 76
Using AEtnaNova to formally prove that the Davis-Putnam satisfiability test is correct 76
The automation of syllogistic. I: Syllogistic normal form 74
Preface 73
The axiom of elementary sets. I: Three-variable statements of set-pairing 72
Self-applied proof verification 71
The quest for Diophantine finite-fold-ness 71
A Quadratic Reduction of Constraints over Nested Sets to Purely Boolean Formulae in CNF 71
The decidability of the Bernays-Shoenfinkel-Ramsey class for set theory 68
Uniform relational frameworks for modal inferences 64
A Decidable Theory of Differentiable Functions with Convexities and Concavities on Real Intervals 64
null 63
Complexity Assessments for Decidable Fragments of Set Theory. I: A Taxonomy for the Boolean Case 61
Set-syllogistics meet combinatorics 59
Solvable (and unsolvable) cases of the decision problem for fragments of analysis 57
Complexity assessments for decidable fragments of set theory. II: A taxonomy for ‘small’ languages involving membership 57
Two Crucial Cubic-Time Components of Polynomial-Maximal Decidable Boolean Languages. 57
On sets and graphs: Perspectives on logic and combinatorics 56
From Hilbert's 10th Problem to slim, Undecidable Fragments of Set Theory 56
Stating infinity in set/hyperset theories 53
A Brief History of Singlefold Diophantine Definitions 52
Very Weak, Essentially Undecidabile Set Theories. 50
Cumulative hierarchies and computability over universes of sets. 40
Instructing equational set-reasoning with Otter 40
Gerarchie cumulative e computabilità sopra universi d’insiemi 40
null 39
Some decidability issues concerning C^n real functions 38
A Decidable Theory Treating Addition of Differentiable Real Functions. 38
A decidable theory involving addition of differentiable real functions 33
Algebraic semantics of ER-models in the context of the calculus of relations. II: Dynamic view. 33
Continued Hereditarily Finite Set-Approximations 30
On generalised Ackermann encodings – the basis issue 29
Complexity assessments for decidable fragments of Set Theory. III: Testers for crucial, polynomial-maximal decidable Boolean languages 21
Totale 10.306
Salva come PNG Salva come JPEG
Categoria #
all - tutte 31.599
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 31.599
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/2020368 0 0 0 0 0 0 0 0 0 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/20251.206 24 110 117 152 120 189 148 128 179 39 0 0
Totale 10.391