arXiv subjects

Alberto Marcone

Publications and source records attributed to Alberto Marcone.

42 records · Page 3Linked to original sources

arXiv2009

How incomputable is the separable Hahn-Banach theorem?

We determine the computational complexity of the Hahn-Banach Extension Theorem. To do so, we investigate some basic connections between reverse mathematics and computable analysis. In particular, we use Weak Konig's Lemma within the framework of computable analysis to classify incomputable functions of low complexity. By defining the multi-valued function Sep and a natural notion of reducibility for multi-valued functions, we obtain a computational counterpart of the subsystem of second order arithmetic WKL_0. We study analogies and differences between WKL_0 and the class of Sep-computable multi-valued functions. Extending work of Brattka, we show that a natural multi-valued function associated with the Hahn-Banach Extension Theorem is Sep-complete.

math.LO↗

arXiv2007

Interval orders and reverse mathematics

We study the reverse mathematics of interval orders. We establish the logical strength of the implications between various definitions of the notion of interval order. We also consider the strength of different versions of the characterization theorem for interval orders: a partial order is an interval order if and only if it does not contain $2 \oplus 2$. We also study proper interval orders and their characterization theorem: a partial order is a proper interval order if and only if it contains neither $2 \oplus 2$ nor $3 \oplus 1$.

math.LO↗

arXiv1996

Ordinary differential equations and descriptive set theory: uniqueness and globality of solutions of Cauchy problems in one dimension

We study some natural sets arising in the theory of ordinary differential equations in one variable from the point of view of descriptive set theory and in particular classify them within the Borel hierarchy. We prove that the set of Cauchy problems for ordinary differential equations which have a unique solution is $Π^0_2$-complete and that the set of Cauchy problems which locally have a unique solution is $Σ^0_3$-complete. We prove that the set of Cauchy problems which have a global solution is $Σ^0_4$-complete and that the set of ordinary differential equation which have a global solution for every initial condition is $Π^0_3$-complete. We prove that the set of Cauchy problems for which both uniqueness and globality hold is $Π^0_2$-complete.

math.LO↗

arXiv1996

Lebesgue numbers and Atsuji spaces in subsystems of second order arithmetic

We study properties of complete separable metric spaces within the framework of subsystems of second order arithmetic. In particular we consider Lebesgue and Atsuji spaces. The former are those such that every open covering U has a Lebesgue number, i.e. a positive number q such that for every point x of the space, there exists an element of U which contains the ball of center x and radius q; the latter are those such that every continuous function into another complete separable metric space is uniformly continuous. The main results we obtain are the following: the statement "every compact space is Lebesgue" is equivalent to WKL_0; the statements "every perfect Lebesgue space is compact" and "every perfect Atsuji space is compact" are equivalent to ACA_0; the statement "every Lebesgue space is Atsuji" is provable in RCA_0; the statement "every Atsuji space is Lebesgue" is provable in ACA_0, but we do not know if it is equivalent to ACA_0. We also prove that the statement "the distance from a closed set is a continuous function" is equivalent to Pi^1_1-CA_0; the statements "there exists a complete separable metric space which is perfect and Heine-Borel compact (resp. Lebesgue, Atsuji)" are all equivalent to WKL_0.

math.LO↗

arXiv1994

On the logical strength of Nash-Williams' theorem on transfinite sequences

We show that Nash-Williams' theorem asserting that the countable transfinite sequences of elements of a better-quasi-ordering ordered by embeddability form a better-quasi-ordering is provable in the subsystem of second order arithmetic Pi^1_1-CA_0 but is not equivalent to Pi^1_1-CA_0. We obtain some partial results towards the proof of this theorem in the weaker subsystem ATR_0 and we show that the minimality lemmas typical of wqo and bqo theory imply Pi^1_1-CA_0 and hence cannot be used in such a proof.

math.LO↗

arXiv1994

Bqo is Pi^1_2-complete

In this paper we prove that the set of countable bqos (viewed as a subset of the Cantor space) is Pi^1_2-complete. The notion of bqo or better quasi-ordering arises from combinatorics and is a generalization of the canonical example of a Pi^1_1-complete notion, i.e. that of countable well-ordering. The Pi^1_2-completeness of bqo was conjectured by Clote and proved by the author in his Ph.d. thesis: in this paper we prove it using Simpson's definition of bqo and as little bqo theory as possible.

math.LO↗