Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Manlio Valenti"'
Autor:
Alberto Marcone, Manlio Valenti
Publikováno v:
Fundamenta Mathematicae. 257:69-93
In this paper we study the notion of Salem set from the point of view of descriptive set theory. We first work in the hyperspace $\mathbf{K}([0,1])$ of compact subsets of $[0,1]$ and show that the closed Salem sets form a $\boldsymbol{\Pi}^0_3$-compl
Autor:
Giovanni Soldà, 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 problem with codomain $\mathbb{N}$ that is Weihrauch reducible to $f$"
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2d5119fc2f4e832a2af5f836ecf18d03
Autor:
Manlio Valenti
Publikováno v:
The Bulletin of Symbolic Logic. 28:266-267
This thesis is devoted to the exploration of the complexity of some mathematical problems using the framework of computable analysis and (effective) descriptive set theory. We will especially focus on Weihrauch reducibility as a means to compare the
Autor:
Alberto Marcone, Manlio Valenti
In this paper, we study Hausdorff and Fourier dimension from the point of view of effective descriptive set theory and Type-2 Theory of Effectivity. Working in the hyperspace $\mathbf{K}(X)$ of compact subsets of $X$, with $X=[0,1]^d$ or $X=\mathbb{R
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5792290448929de55fdd27de59340248
Autor:
Manlio Valenti, Alberto Marcone
We investigate the uniform computational content of the open and clopen Ramsey theorems in the Weihrauch lattice. While they are known to be equivalent to $\mathrm{ATR_0}$ from the point of view of reverse mathematics, there is not a canonical way to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::142338d2e5d94e3e8efb9d02b2033ecc
http://hdl.handle.net/11390/1195039
http://hdl.handle.net/11390/1195039
Publikováno v:
The Journal of Symbolic Logic
In this work we investigate the Weihrauch degree of the problem $\mathsf{DS}$ of finding an infinite descending sequence through a given ill-founded linear order, which is shared by the problem $\mathsf{BS}$ of finding a bad sequence through a given
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::caa0ce02a1fa6836875abb9fdea3b99d
http://arxiv.org/abs/2010.03840
http://arxiv.org/abs/2010.03840