ArTS Archivio della ricerca di Trieste

OMODEO, EUGENIO
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 5.298
EU - Europa 3.358
AS - Asia 993
AF - Africa 7
SA - Sud America 7
OC - Oceania 6
Continente sconosciuto - Info sul continente non disponibili 4
Totale 9.673
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 5.285
PL - Polonia 815
IT - Italia 655
SE - Svezia 529
UA - Ucraina 484
HK - Hong Kong 289
CN - Cina 262
SG - Singapore 220
FI - Finlandia 162
TR - Turchia 153
DE - Germania 151
GB - Regno Unito 125
BG - Bulgaria 99
IE - Irlanda 91
RU - Federazione Russa 87
FR - Francia 67
CH - Svizzera 31
VN - Vietnam 22
BE - Belgio 21
NL - Olanda 14
IN - India 13
CA - Canada 12
AT - Austria 9
JP - Giappone 8
BR - Brasile 6
IR - Iran 6
RO - Romania 6
AU - Australia 5
MY - Malesia 5
A1 - Anonimo 4
ES - Italia 4
BN - Brunei Darussalam 3
CZ - Repubblica Ceca 3
GR - Grecia 3
SN - Senegal 3
TH - Thailandia 3
IL - Israele 2
LU - Lussemburgo 2
ZA - Sudafrica 2
AM - Armenia 1
BD - Bangladesh 1
CO - Colombia 1
ID - Indonesia 1
KR - Corea 1
KZ - Kazakistan 1
LY - Libia 1
MX - Messico 1
NG - Nigeria 1
NP - Nepal 1
NZ - Nuova Zelanda 1
OM - Oman 1
Totale 9.673
Salva come PNG Salva come JPEG
Città #
Warsaw 811
Ann Arbor 750
Woodbridge 731
Houston 519
Fairfield 440
Jacksonville 438
Chandler 377
Wilmington 294
Hong Kong 288
Ashburn 242
Trieste 213
Seattle 183
Princeton 180
Singapore 178
Boardman 175
Cambridge 155
Izmir 146
Beijing 117
Sofia 99
Columbus 96
Bremen 94
Dublin 89
Moscow 67
Milan 39
San Diego 38
Santa Clara 29
Udine 28
Bern 27
Verona 26
Dong Ket 22
Chicago 20
Mestre 19
Helsinki 16
Falls Church 15
Brussels 13
Düsseldorf 13
Redwood City 12
Vicenza 12
Los Angeles 10
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
Kocaeli 7
London 7
Redmond 7
Venice 7
Hefei 6
Kunming 6
Rome 6
Shanghai 6
Amsterdam 5
Catania 5
Dubino 5
Indiana 5
Mumbai 5
Bognor Regis 4
Dearborn 4
Fano 4
Guangzhou 4
Kraków 4
Ottawa 4
Porto Recanati 4
Riverside 4
Tokyo 4
Toronto 4
Ancona 3
Bandar Seri Begawan 3
Bologna 3
Bolzano 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
Azor 2
Bellaterra 2
Berlin 2
Castelfranco Veneto 2
Chavannes 2
Chengdu 2
Chester 2
Dongguan 2
Dormagen 2
Totale 7.297
Salva come PNG Salva come JPEG
Nome #
A Diophantine representation of Wolstenholme's pseudoprimality 326
Proof verification within set theory 290
On Perfect Matchings for some Bipartite Graphs 232
Can a Single Equation Witness that every r.e. Set Admits a Finite-fold Diophantine Representation? 201
Theory-specific automated reasoning 184
Banishing Ultrafilters from Our Consciousness 176
Reasoning on Relations, Modalities, and Sets 176
Decidability results for sets with atoms 168
On the Diophantine complexity of the set of prime numbers 166
An environment for specifying properties of dyadic relations and reasoning about them. II: Relational presentation of non-classical logics. 163
An equational re-engineering of set theories 162
Reasoning about connectivity without paths 153
Preface to the Proceedings of the 34th Italian Conference on Computational Logic (CILC 2019) 151
Three-variable statements of set-pairing 145
Set Graphs. V. On representing graphs as membership digraphs 141
The axiom of elementary sets on the edge of Peircean expressibility 137
Does every recursively enumerable set admit a finite-fold diophantine representation? 137
Polynomial-time satisfiability tests for boolean fragments of set theory 137
Topological syllogistic with continuous and closed functions 134
Hyper-Extensionality and One-Node Elimination on Membership Graphs 134
Set Graphs. III. Proof Pearl: Claw-Free Graphs Mirrored into Transitive Hereditarily Finite Sets 133
Computable Set Theory, vol. I 129
A `Theory' mechanism for a proof verifier based on first-order set theory 129
Rasiowa-Sikorski style Relational Elementary Set Theory 127
Decision procedures for elementary sublanguages of set theory. I: Multi-level syllogistic and some extensions 124
A proof-checking experiment on representing graphs as membership digraphs 124
ER modelling from first relational principles 120
A graphical representation of relational formulae with complementation 120
The Representation of Boolean Algebras in the Spotlight of a Proof Checker 119
null 118
Formative processes with applications to the decision problem in set theory: I. Powerset and singleton operators 117
Decision procedures for elementary sublanguages of set theory. II: Formulas involving restricted quantifiers together with ordinal, integer, map, and domain notions 117
Mapping Sets and Hypersets into Numbers 117
Computational Logic and Set Theory -- Applying Formalized Logic to Analysis 114
Goals and benchmarks for automated map reasoning 113
Le radici forti dell'Informatica – L'intreccio storico tra tecnologia e fondamenti logici della matematica 113
The Linked Conjunct method for automatic deduction and related search techniques 111
A computerized Referee 110
Solvable set/hyperset contexts: I. Some decision procedures for the pure, finite case 108
Notes from the logbook of a proof-checker's project 105
Decision algorithms for some fragments of analysis and related areas 104
Layered map reasoning: An experiment put to trial on sets 103
Bisimilarity, hypersets and stable partitioning: a survey 102
An environment for specifying properties of dyadic relations and reasoning about them. I: Language extension mechanisms. 100
Martin Davis’s Bibliography 1950–2015 99
Compiling dyadic first-order specifications into map algebra 96
Automation of aggregate theories: The cornerstones of equational expressibility. 95
A derived algorithm for evaluating epsilon-expressions over abstract sets 93
Statements of ill-founded infinity in Set Theory 92
The Ref Proof-Checker and Its “Common Shared Scenario” 92
null 91
Decidability of E*A-sentences in membership theories 91
Decision procedures for elementary sublanguages of set theory, VII: Validity in set theory when a choice operator is present 89
A graphical approach to relational reasoning 88
The automation of syllogistic. II: Optimization and complexity issues 87
Infinity, in short. 87
Decision procedures for elementary sublanguages of set theory. VIII: A semidecision procedure for finite satisfiability of unquantified set-theoretic formulae 86
Transitive Venn diagrams with applications to the decision problem in set theory 86
Set Theory for Computing - From decision procedures to declarative programming with sets 83
Three existence principles in a modal calculus without descriptions in A. Bressan's MC^nu 83
{log}: A logic programming language with finite sets 83
The Bernays-Schönfinkel-Ramsey class for set theory: decidability. 82
The axiom of elementary sets. II: The edge of Peircean expressibility 82
Views on time in systems biology 80
The elimination of descriptions from A. Bressan's modal language ML^nu on which the logical calculus MC^nu is based 80
Solvable set/hyperset contexts: II. A goal-driven algorithm for the blended case 76
The Bernays-Schönfinkel-Ramsey class for set theory: semidecidability. 76
Using AEtnaNova to formally prove that the Davis-Putnam satisfiability test is correct 73
The automation of syllogistic. I: Syllogistic normal form 71
The axiom of elementary sets. I: Three-variable statements of set-pairing 70
A language for programming in logic with finite sets 69
Self-applied proof verification 69
Preface 69
The quest for Diophantine finite-fold-ness 69
A Quadratic Reduction of Constraints over Nested Sets to Purely Boolean Formulae in CNF 67
The decidability of the Bernays-Shoenfinkel-Ramsey class for set theory 64
Uniform relational frameworks for modal inferences 63
null 63
Solvable (and unsolvable) cases of the decision problem for fragments of analysis 56
A Decidable Theory of Differentiable Functions with Convexities and Concavities on Real Intervals 56
Complexity Assessments for Decidable Fragments of Set Theory. I: A Taxonomy for the Boolean Case 55
On sets and graphs: Perspectives on logic and combinatorics 53
Set-syllogistics meet combinatorics 52
Complexity assessments for decidable fragments of set theory. II: A taxonomy for ‘small’ languages involving membership 52
Two Crucial Cubic-Time Components of Polynomial-Maximal Decidable Boolean Languages. 51
Stating infinity in set/hyperset theories 49
From Hilbert's 10th Problem to slim, Undecidable Fragments of Set Theory 49
Very Weak, Essentially Undecidabile Set Theories. 47
null 39
Instructing equational set-reasoning with Otter 38
Some decidability issues concerning C^n real functions 35
Cumulative hierarchies and computability over universes of sets. 35
Gerarchie cumulative e computabilità sopra universi d’insiemi 35
A Brief History of Singlefold Diophantine Definitions 35
A Decidable Theory Treating Addition of Differentiable Real Functions. 32
A decidable theory involving addition of differentiable real functions 31
Algebraic semantics of ER-models in the context of the calculus of relations. II: Dynamic view. 30
On generalised Ackermann encodings – the basis issue 21
Complexity assessments for decidable fragments of Set Theory. III: Testers for crucial, polynomial-maximal decidable Boolean languages 18
Reconciling transparency, low Δ0-complexity and axiomatic weakness in undecidability proofs 15
Totale 9.918
Salva come PNG Salva come JPEG
Categoria #
all - tutte 29.225
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 29.225
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/2020808 0 0 0 0 0 0 111 196 133 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/2025799 24 110 117 152 120 189 87 0 0 0 0 0
Totale 9.984