SORBI, ANDREA
 Distribuzione geografica
Continente #
NA - Nord America 6.223
EU - Europa 5.464
AS - Asia 1.036
OC - Oceania 10
SA - Sud America 9
AF - Africa 8
Continente sconosciuto - Info sul continente non disponibili 5
AN - Antartide 1
Totale 12.756
Nazione #
US - Stati Uniti d'America 6.200
GB - Regno Unito 1.825
IE - Irlanda 944
CN - Cina 617
IT - Italia 573
UA - Ucraina 438
SE - Svezia 428
RU - Federazione Russa 403
FR - Francia 322
SG - Singapore 226
DE - Germania 197
FI - Finlandia 123
ES - Italia 105
GE - Georgia 54
TR - Turchia 49
NL - Olanda 28
IN - India 20
CA - Canada 19
VN - Vietnam 17
BE - Belgio 16
RO - Romania 16
KZ - Kazakistan 11
AU - Australia 10
GR - Grecia 8
IL - Israele 8
CH - Svizzera 7
PL - Polonia 7
AT - Austria 6
IR - Iran 6
CI - Costa d'Avorio 5
JP - Giappone 5
A2 - ???statistics.table.value.countryCode.A2??? 4
CZ - Repubblica Ceca 4
HK - Hong Kong 3
HU - Ungheria 3
PE - Perù 3
PK - Pakistan 3
AR - Argentina 2
BH - Bahrain 2
BR - Brasile 2
CR - Costa Rica 2
DK - Danimarca 2
EG - Egitto 2
ID - Indonesia 2
IM - Isola di Man 2
MY - Malesia 2
PH - Filippine 2
QA - Qatar 2
RS - Serbia 2
UZ - Uzbekistan 2
AL - Albania 1
AZ - Azerbaigian 1
BG - Bulgaria 1
CL - Cile 1
EU - Europa 1
GS - Georgia del Sud e Isole Sandwich Australi 1
HR - Croazia 1
JM - Giamaica 1
KR - Corea 1
LK - Sri Lanka 1
LT - Lituania 1
MA - Marocco 1
PA - Panama 1
SA - Arabia Saudita 1
SI - Slovenia 1
TH - Thailandia 1
VE - Venezuela 1
Totale 12.756
Città #
Southend 1.709
Fairfield 1.081
Dublin 944
Ashburn 554
Woodbridge 491
Chandler 452
Houston 373
Seattle 371
Jacksonville 364
Wilmington 350
Cambridge 338
Santa Clara 317
Ann Arbor 265
Beijing 147
Singapore 141
Princeton 136
Siena 135
Dearborn 111
Nanjing 111
Málaga 98
Menlo Park 92
Helsinki 74
San Mateo 70
San Diego 55
Boardman 51
Rome 51
Moscow 43
Shanghai 43
Nanchang 34
Izmir 31
Tbilisi 30
Shenyang 29
Florence 21
Hebei 20
Jinan 20
Amsterdam 19
Kunming 18
Dong Ket 17
Brussels 16
Changsha 16
Redwood City 15
San Francisco 15
Tianjin 15
Jiaxing 14
London 14
Toronto 14
Fremont 12
Hangzhou 12
Munich 12
Norwalk 12
Timisoara 12
Milan 11
Ningbo 11
Venezia 11
Zhengzhou 11
Guangzhou 10
Mumbai 10
Prato 10
Taizhou 10
Hefei 9
Düsseldorf 7
Los Angeles 7
Ansbach 6
Astana 6
Council Bluffs 6
Gevelsberg 6
Abidjan 5
Indiana 5
Kilburn 5
Latina 5
San Jose 5
Vienna 5
Almaty 4
Auburn Hills 4
Canberra 4
Foggia 4
Frankfurt am Main 4
Fuzhou 4
Guidonia Montecelio 4
Hadera 4
Lanzhou 4
Livorno 4
New York 4
Ottawa 4
Paris 4
Prague 4
Saint Petersburg 4
Sarzana 4
West Jordan 4
Zurich 4
Bari 3
Berlin 3
Budapest 3
Campi Bisenzio 3
Chicago 3
Chiswick 3
Curtarolo 3
Darmstadt 3
Haikou 3
Hounslow 3
Totale 9.648
Nome #
Trial and error mathematics I: dialectical and quasi-dialectical systems 349
Trial and error mathematics II: dialectical sets and quasi-dialectical sets, their degrees, and their distribution within the class of limit sets. 254
∑0n-equivalence relations 239
Ricordo di Franco Montagna 233
Jumps of computably enumerable equivalence relations 230
Taking the Pirahã seriously 218
Joins and meets in the structure of ceers 213
On learning to coordinate random bits help, insightful normal forms, and competency isomorphisms 209
A survey on universal computably enumerable equivalence relations 207
A note on uniform density in weak arithmetical theories 202
On learning to coordinate: random bits help, insightful normal forms, and competency isomorphisms 199
Effective inseparability, lattices, and preordering relations 196
A note on algebras of languages 195
Calibrating word problems of groups via the complexity of equivalence relations 193
Positive undecidable numberings in the Ershov hierarchy 192
Weakly precomplete computably enumerable equivalence relations 186
Trial and error mathematics: dialectical systems and completions of theories 186
Pomology observations, morphometric analysis, ultrastructural study and allelic profiles of "olivastra Seggianese" endocarps from ancient olive trees (Olea europaea L.) 181
High minimal pairs in the enumeration degrees 180
Comparing the degrees of enumerability and the closed Medvedev degrees 179
Le direzioni della ricerca logica in Italia: la teoria (classica) della computabilità 175
Some remarks on completion of numberings 174
S. Barry Cooper (1943-2015) 168
Universal computably enumerable equivalence relations 164
Strong positive reducibilities 162
A characterization of the Δ20 hyperhyperimmune sets 160
The complexity of index sets of classes of computably enumerable equivalence relations 157
Friedberg numberings in the Ershov hierarchy 155
Singleton enumeration reducibility and arithmetic 155
Isomorphism types of Rogers semilattices for families from different levels of the arithmetical hierarchy 150
Bounded enumeration reducibility and its degree structure 148
Strong enumeration reducibilities 148
Elementary theories for Rogers semilattices 148
Logic and probabilistic systems 146
The theory of ceers computes true arithmetic 145
Classifying equivalence relations in the Ershov hierarchy 145
A note on initial segments of the enumeration degrees 143
A Note on Relative Efficiency of Axiom Systems 140
Incomparability in local structures of $s$-degrees and $Q$-degrees 140
Topological aspects of the Medvedev lattice 139
A note on the enumeration degrees of 1-generic sets 139
Bounding nonsplitting enumeration degrees 137
Bounding and nonbounding minimal pairs in the enumeration degrees 137
There exists a maximal 3-c.e. enumeration degree 135
Morfometria geometrica non invasiva su semi archeologici di vite per risalire all'origine di antiche varietà antropiche 133
Generalizations of the Weak Law of the Excluded Middle 132
The first order theories of the Medvedev and Muchnik lattices 129
Elementary properties of Rogers semilattices of arithmetical numberings 125
Diamond embeddings into the enumeration degrees 125
Immunity properties and strong positive reducibilities 125
Undecidability of local structures of s-degrees and Q-degrees 123
Immunity properties of the s-degrees 122
Algebraic properties of Rogers semilattices of arithmetical numberings 114
Rogers semilattices of families of two embedded sets in the Ershov hierarchy 113
Noncappable enumeration degrees below 0e′ 111
Initial segments of the Σ0 2 enumeration degrees 110
Intermediate logics and factors of the Medvedev lattice 110
Intuitionistic logic and Muchnik degrees 110
Completeness and universality of arithmetical numberings 109
Empty intervals in the enumeration degrees 105
Branching in the Σ02 -enumeration degrees: a new perspective 104
Lattices of local two-dimensional languages 104
Some Quotient Lattices of the Medvedev Lattice 104
Self-full ceers and the uniform join operator 104
Branching in the enumeration degrees of the Σ02sets 103
Reducibility in some categories of partial recursive operators 103
On some filters and ideals of the Medvedev lattice 100
The category of equivalence relations 97
Creativeness and completeness in recursion categories of partial recursive operators 96
A note on closed degrees of difficulty of the Medvedev lattice 94
Universal recursion theoretic properties of r.e. preordered structures 93
Cupping and noncupping in the enumeration degrees of Σ02 sets 92
Sets of generators and automorphism bases for the enumeration degrees 92
Quasi-minimal enumeration degrees and minimal Turing degrees 91
Isomorphism types and theories of Rogers semilattices of arithmetical numberings 91
Some remarks on the algebraic structure of the Medvedev Lattice 91
Classifying positive equivalence relations 88
Primitive recursive equivalence relations and their primitive recursive complexity 86
Embeddings into the enumeration degrees 85
Initial segments of the degrees of ceers 83
Generalized computable numerations and nontrivial rogers semilattices 81
Embedding finite lattices into the \Sigma-0-2 enumeration degrees 79
In memoriam: Barry Cooper 1943-2015 78
Density results in the Delta-0-2 e-degrees 78
Embedding Brouwer algebras in the Medvedev lattice 77
On extensions of embeddings into the enumeration degrees of the Σ02-sets 76
Comparing Pi^0_2 of the Baire space by means of general recursive operators 76
Word problems and ceers 76
Properly Σ02 enumeration degrees and the high/low hierarchy 76
On elementary theories and isomorphism types of Rogers semilattices 73
Classifying word problems of finitely generated algebras via computable reducibility 70
Structural properties and Sigma^0_2 enumeration degrees 69
The Medvedev lattice of degrees of difficulty 68
Minimal degrees and downwards density in some strong positive reducibilities and quasi-reducibilities 65
Open problems in the enumeration degrees 64
The distribution of properly Sigma(0)(2) e-degrees 63
On Quasi-Minimal E-Degrees And Total e-Degrees 62
Effective Inseparability and Its Applications 61
Some remarks on tiling recognizable languages 54
Notes on conjunctive and quasi degrees 46
Totale 13.040
Categoria #
all - tutte 42.577
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 42.577


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/20201.553 0 0 0 0 0 0 332 415 239 263 133 171
2020/20212.288 132 224 163 206 177 271 122 348 179 177 143 146
2021/20221.447 93 220 102 90 50 55 131 63 62 176 159 246
2022/20231.859 123 173 225 252 148 346 67 125 175 111 78 36
2023/20241.439 50 31 136 122 47 341 483 20 2 74 16 117
2024/20251.037 81 158 270 130 279 118 1 0 0 0 0 0
Totale 13.237