SORBI, ANDREA
 Distribuzione geografica
Continente #
NA - Nord America 5.839
EU - Europa 4.981
AS - Asia 750
OC - Oceania 9
SA - Sud America 6
Continente sconosciuto - Info sul continente non disponibili 5
AF - Africa 3
AN - Antartide 1
Totale 11.594
Nazione #
US - Stati Uniti d'America 5.820
GB - Regno Unito 1.822
IE - Irlanda 944
CN - Cina 570
IT - Italia 523
UA - Ucraina 436
SE - Svezia 428
FR - Francia 317
DE - Germania 183
FI - Finlandia 122
ES - Italia 105
GE - Georgia 52
TR - Turchia 48
NL - Olanda 18
VN - Vietnam 17
RO - Romania 16
CA - Canada 15
BE - Belgio 14
RU - Federazione Russa 14
KZ - Kazakistan 10
AU - Australia 9
IN - India 9
GR - Grecia 8
IL - Israele 7
SG - Singapore 7
CH - Svizzera 6
IR - Iran 6
PL - Polonia 6
AT - Austria 5
JP - Giappone 5
A2 - ???statistics.table.value.countryCode.A2??? 4
CZ - Repubblica Ceca 3
HK - Hong Kong 3
HU - Ungheria 3
PK - Pakistan 3
AR - Argentina 2
CR - Costa Rica 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
BR - Brasile 1
CL - Cile 1
DK - Danimarca 1
EU - Europa 1
GS - Georgia del Sud e Isole Sandwich Australi 1
HR - Croazia 1
JM - Giamaica 1
MA - Marocco 1
PA - Panama 1
PE - Perù 1
SA - Arabia Saudita 1
SI - Slovenia 1
TH - Thailandia 1
VE - Venezuela 1
Totale 11.594
Città #
Southend 1.709
Fairfield 1.081
Dublin 944
Ashburn 547
Woodbridge 491
Chandler 452
Houston 373
Seattle 371
Jacksonville 364
Wilmington 350
Cambridge 337
Ann Arbor 265
Beijing 145
Princeton 136
Siena 129
Dearborn 111
Nanjing 111
Málaga 98
Menlo Park 92
Helsinki 74
San Mateo 70
San Diego 54
Boardman 43
Rome 40
Shanghai 38
Nanchang 34
Izmir 30
Shenyang 29
Tbilisi 28
Florence 20
Hebei 20
Jinan 20
Kunming 18
Dong Ket 17
Changsha 16
Redwood City 15
San Francisco 15
Brussels 14
Jiaxing 14
London 14
Tianjin 14
Fremont 12
Hangzhou 12
Norwalk 12
Timisoara 12
Ningbo 11
Toronto 11
Venezia 11
Zhengzhou 11
Amsterdam 10
Hefei 9
Taizhou 9
Prato 8
Düsseldorf 7
Los Angeles 7
Ansbach 6
Astana 6
Gevelsberg 6
Singapore 6
Guangzhou 5
Indiana 5
Kilburn 5
Latina 5
Milan 5
San Jose 5
Auburn Hills 4
Canberra 4
Foggia 4
Guidonia Montecelio 4
Hadera 4
Lanzhou 4
New York 4
Saint Petersburg 4
Sarzana 4
Vienna 4
West Jordan 4
Zurich 4
Almaty 3
Bari 3
Budapest 3
Campi Bisenzio 3
Chiswick 3
Curtarolo 3
Darmstadt 3
Frankfurt am Main 3
Fuzhou 3
Haikou 3
Hounslow 3
Kocaeli 3
Lancaster 3
Leicester 3
Livorno 3
Melbourne 3
Merano 3
Monte San Savino 3
Moscow 3
Odesa 3
Ottawa 3
Palermo 3
Philadelphia 3
Totale 9.056
Nome #
Trial and error mathematics I: dialectical and quasi-dialectical systems 331
Trial and error mathematics II: dialectical sets and quasi-dialectical sets, their degrees, and their distribution within the class of limit sets. 233
Jumps of computably enumerable equivalence relations 222
Ricordo di Franco Montagna 218
Taking the Pirahã seriously 203
Joins and meets in the structure of ceers 201
A survey on universal computably enumerable equivalence relations 195
On learning to coordinate random bits help, insightful normal forms, and competency isomorphisms 193
Effective inseparability, lattices, and preordering relations 188
A note on uniform density in weak arithmetical theories 185
On learning to coordinate: random bits help, insightful normal forms, and competency isomorphisms. 183
∑0n-equivalence relations 183
Positive undecidable numberings in the Ershov hierarchy 182
Calibrating word problems of groups via the complexity of equivalence relations 182
A note on algebras of languages 176
High minimal pairs in the enumeration degrees 171
Comparing the degrees of enumerability and the closed Medvedev degrees 171
Weakly precomplete computably enumerable equivalence relations 166
Pomology observations, morphometric analysis, ultrastructural study and allelic profiles of "olivastra Seggianese" endocarps from ancient olive trees (Olea europaea L.) 166
Trial and error mathematics: dialectical systems and completions of theories 166
Some remarks on completion of numberings 165
Le direzioni della ricerca logica in Italia: la teoria (classica) della computabilità 158
Strong positive reducibilities 156
S. Barry Cooper (1943-2015) 154
Universal computably enumerable equivalence relations 153
The complexity of index sets of classes of computably enumerable equivalence relations 150
Singleton enumeration reducibility and arithmetic 148
Friedberg numberings in the Ershov hierarchy 147
A characterization of the Δ20 hyperhyperimmune sets 147
Isomorphism types of Rogers semilattices for families from different levels of the arithmetical hierarchy 141
Strong enumeration reducibilities 141
Elementary theories for Rogers semilattices 139
Logic and probabilistic systems 135
The theory of ceers computes true arithmetic 134
Bounded enumeration reducibility and its degree structure 132
Incomparability in local structures of $s$-degrees and $Q$-degrees 132
Topological aspects of the Medvedev lattice 130
A note on initial segments of the enumeration degrees 130
A note on the enumeration degrees of 1-generic sets 130
There exists a maximal 3-c.e. enumeration degree 128
A Note on Relative Efficiency of Axiom Systems 128
Classifying equivalence relations in the Ershov hierarchy 128
Bounding and nonbounding minimal pairs in the enumeration degrees 127
Bounding nonsplitting enumeration degrees 125
Generalizations of the Weak Law of the Excluded Middle 124
The first order theories of the Medvedev and Muchnik lattices 121
Morfometria geometrica non invasiva su semi archeologici di vite per risalire all'origine di antiche varietà antropiche 119
Elementary properties of Rogers semilattices of arithmetical numberings 117
Diamond embeddings into the enumeration degrees 117
Immunity properties and strong positive reducibilities 117
Immunity properties of the s-degrees 114
Undecidability of local structures of s-degrees and Q-degrees 113
Algebraic properties of Rogers semilattices of arithmetical numberings 105
Rogers semilattices of families of two embedded sets in the Ershov hierarchy 105
Initial segments of the Σ0 2 enumeration degrees 104
Noncappable enumeration degrees below 0e′ 103
Completeness and universality of arithmetical numberings 102
Intermediate logics and factors of the Medvedev lattice 102
Intuitionistic logic and Muchnik degrees 101
Reducibility in some categories of partial recursive operators 97
Lattices of local two-dimensional languages 96
Empty intervals in the enumeration degrees 96
Some Quotient Lattices of the Medvedev Lattice 94
On some filters and ideals of the Medvedev lattice 94
Self-full ceers and the uniform join operator 94
Branching in the Σ02 -enumeration degrees: a new perspective 93
Branching in the enumeration degrees of the Σ02sets 90
Creativeness and completeness in recursion categories of partial recursive operators 90
Cupping and noncupping in the enumeration degrees of Σ02 sets 85
A note on closed degrees of difficulty of the Medvedev lattice 85
Some remarks on the algebraic structure of the Medvedev Lattice 84
Sets of generators and automorphism bases for the enumeration degrees 84
Universal recursion theoretic properties of r.e. preordered structures 83
The category of equivalence relations 83
Isomorphism types and theories of Rogers semilattices of arithmetical numberings 82
Quasi-minimal enumeration degrees and minimal Turing degrees 81
Embeddings into the enumeration degrees 77
Classifying positive equivalence relations 77
Generalized computable numerations and nontrivial rogers semilattices 73
Embedding finite lattices into the \Sigma-0-2 enumeration degrees 72
In memoriam: Barry Cooper 1943-2015 72
Embedding Brouwer algebras in the Medvedev lattice 72
Density results in the Delta-0-2 e-degrees 70
Properly Σ02 enumeration degrees and the high/low hierarchy 69
On extensions of embeddings into the enumeration degrees of the Σ02-sets 68
On elementary theories and isomorphism types of Rogers semilattices 64
Initial segments of the degrees of ceers 64
Comparing Pi^0_2 of the Baire space by means of general recursive operators 62
Structural properties and Sigma^0_2 enumeration degrees 62
Word problems and ceers 62
Primitive recursive equivalence relations and their primitive recursive complexity 60
The Medvedev lattice of degrees of difficulty 57
Open problems in the enumeration degrees 57
The distribution of properly Sigma(0)(2) e-degrees 55
ON QUASI-MINIMAL E-DEGREES AND TOTAL E-DEGREES 54
Effective Inseparability and Its Applications 51
Minimal degrees and downwards density in some strong positive reducibilities and quasi-reducibilities 46
Some remarks on tiling recognizable languages 45
Classifying word problems of finitely generated algebras via computable reducibility 40
Notes on conjunctive and quasi degrees 39
Totale 11.916
Categoria #
all - tutte 36.135
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 36.135


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2018/2019545 0 0 0 0 0 0 0 0 0 0 248 297
2019/20203.122 239 90 128 512 284 316 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.314 50 31 136 122 47 341 483 20 2 74 8 0
Totale 12.075