11 citations · 29 across the 12 of their papers we have counts for
3 papers · 1 filter
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…
Categorifying computable reducibilities
Davide Trotta, Manlio Valenti, Valeria de Paiva
This paper presents categorical formulations of Turing, Medvedev, Muchnik, and Weihrauch reducibilities in Computability Theory, utilizing Lawvere doctrines. While the first notion…
Algebraic properties of the first-order part of a problem
Giovanni Solda, Manlio Valenti
In this paper we study the notion of first-order part of a computational problem, first introduced by Dzhafarov, Solomon, and Yokoyama, which captures the "strongest computational…