1 citations · 1 across the 2 of their papers we have counts for
4 papers
Generalized Higman's Theorem and iterated ideals
Fedor Pakhomov, Giovanni Soldà
Generalized Higman's Theorem is the direct counterpart of Higman's Theorem that asserts the closure of the class of \emph{better} quasi-orders, instead of the class of \emph{well}…
On statistical learning of graphs
Vittorio Cipriani, Valentino Delle Rose, Luca San Mauro +1
We study PAC and online learnability of hypothesis classes formed by copies of a countably infinite graph G, where each copy is induced by permuting G's vertices. This corresponds…
On Nash-Williams' Theorem regarding sequences with finite range
Fedor Pakhomov, Giovanni Soldà
The famous theorem of Higman states that for any well-quasi-order (wqo) the embeddability order on finite sequences over is also wqo. In his celebrated 1965 paper, Nash-Wil…
Sequential discontinuity and first-order problems
Arno Pauly, Giovanni Soldà
We explore the low levels of the structure of the continuous Weihrauch degrees of first-order problems. In particular, we show that there exists a minimal discontinuous first-order…