100 citations · 264 across the 34 of their papers we have counts for
34 papers
Isometry groups of Polish ultrametric spaces
Riccardo Camerlo, Alberto Marcone, Luca Motto Ros
We solve a long-standing open problem, formulated by Krasner in the 1950's, in the context of Polish (i.e. separable complete) ultrametric spaces by providing a characterization of…
Computability of a Whitney Extension
Andrea Brun, Guido Gherardi, Alberto Marcone
We prove the computability of a version of Whitney Extension, when the input is suitably represented. More specifically, if is a closed set represented s…
Piecewise convex embeddability on linear orders
Martina Iannella, Alberto Marcone, Luca Motto Ros +1
Given a nonempty set of linear orders, we say that the linear order is -convex embeddable into the linear order if it is possible to partition $…
Convex Embeddability and Knot Theory
Martina Iannella, Alberto Marcone, Luca Motto Ros +1
We consider countable linear orders and study the quasi-order of convex embeddability and its induced equivalence relation. We obtain both combinatorial and descriptive set-theoret…
Provable better quasi orders
Anton Freund, Alberto Marcone, Fedor Pakhomov +1
It has recently been shown that fairly strong axiom systems such as cannot prove that the antichain with three elements is a better quasi order (). I…
The Weihrauch lattice at the level of : the Cantor-Bendixson theorem
Vittorio Cipriani, Alberto Marcone, Manlio Valenti
This paper continues the program connecting reverse mathematics and computable analysis via the framework of Weihrauch reducibility. In particular, we consider problems related to…