Suivre
Manlio Valenti
Manlio Valenti
Adresse e-mail validée de swansea.ac.uk - Page d'accueil
Titre
Citée par
Citée par
Année
Finding descending sequences through ill-founded linear orders
J Le Goh, A Pauly, M Valenti
The Journal of Symbolic Logic 86 (2), 817-854, 2021
222021
Algebraic properties of the first-order part of a problem
G Solda, M Valenti
Annals of Pure and Applied Logic 174 (7), 103270, 2023
102023
The open and clopen Ramsey theorems in the Weihrauch lattice
A Marcone, M Valenti
The Journal of Symbolic Logic 86 (1), 316-351, 2021
72021
A journey through computability, topology and analysis
M Valenti
Ph. D. thesis, Universitá degli Studi di Udine, 2021
42021
Minimal covers in the Weihrauch degrees
S Lempp, JS Miller, A Pauly, MI Soskova, M Valenti
arXiv preprint arXiv:2311.12676, 2023
32023
Effective aspects of Hausdorff and Fourier dimension
A Marcone, M Valenti
Computability 11 (3-4), 299-333, 2022
22022
On the descriptive complexity of Salem sets
A Marcone, M Valenti
arXiv preprint arXiv:2009.09888, 2020
22020
The tree pigeonhole principle in the Weihrauch degrees
D Dzhafarov, R Solomon, M Valenti
arXiv preprint arXiv:2312.10535, 2023
12023
A jump operator on the Weihrauch degrees
U Andrews, S Lempp, A Marcone, JS Miller, M Valenti
arXiv preprint arXiv:2402.13163, 2024
2024
The weakness of finding descending sequences in ill-founded linear orders
JL Goh, A Pauly, M Valenti
arXiv preprint arXiv:2401.11807, 2024
2024
Is there a jump in the Weihrauch lattice?
M Valenti
2023
The first-order part of computational problems
M Valenti
2022
The Weihrauch lattice at the level of : the Cantor-Bendixson theorem
V Cipriani, A Marcone, M Valenti
arXiv preprint arXiv:2210.15556, 2022
2022
Categorifying computable reducibilities
D Trotta, M Valenti, V de Paiva
arXiv preprint arXiv:2208.08656, 2022
2022
New operators on Weihrauch degrees and their applications to separation results
M Valenti
COMPUTING THE FOURIER DIMENSION
M VALENTI
On the descriptive complexity of Salem sets
M Valenti
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–17