Searcharxiv⌕ Search

arXiv subjects

Vassilios Gregoriades

Publications and source records attributed to Vassilios Gregoriades.

12 recordsLinked to original sources
arXiv2022

On a Question of Jaegers

We show that there exists a positive arithmetical formula $ψ(x,R)$, where $x \in ω$, $R \subseteq ω$, with no hyperarithmetical fixed point. This answers a question of Gerhard Jäger. As corollaries we obtain results on the proof-theoretic strength of the Kripke-Platek set theory; the fixed points of monotone functions in chain-complete partial orders; the non-Borel uniformization of Borel sets; and the hyperdegrees of fixed points of positive formulae. Further we prove a Suslin-Kleene type result for the specific encoding of the hyperarithmetical sets that we are using.

math.LO↗
arXiv2020

Intersections of $\ell^p$ spaces in the Borel hierarchy

We show that if $Y$ is one of the spaces $\ell^q$, $c_0$, $\ell^\infty$ or ${\textstyle \bigcap_{p > b}} \ell^p$ where $0 < q,b < \infty$, and the Fréchet space $\textstyle \bigcap_{p > a} \ell^p$ is contained in $Y$ properly, then $\textstyle \bigcap_{p > a} \ell^p$ first shows up in the Borel hierarchy of $Y$ at the multiplicative class of the third level. In particular $\textstyle \bigcap_{p > a} \ell^p$ is neither an $F_σ$ nor a $G_δ$ subset of $Y$. This answers a question by Nestoridis. This result provides a natural example of a set in the third level of the Borel hierarchy and with its help we also give some examples in the fourth level.

math.FA↗
arXiv2017

Uniformity results on the Baire property

We are concerned with the problem of witnessing the Baire property of the Borel and the projective sets (assuming determinacy) through a sufficiently definable function in the codes. We prove that in the case of projective sets it is possible to satisfy this for almost all codes using a continuous function. We also show that it is impossible to improve this to all codes even if more complex functions in the codes are allowed. We also study the intermediate steps of the Borel hierarchy, and we give an estimation for the complexity of such functions in the codes, which verify the Baire property for actually all codes.

math.LO↗
arXiv2017

The Dyck and the Preiss separation uniformly

We are concerned with two separation theorems about analytic sets by Dyck and Preiss, the former involves the positively-defined subsets of the Cantor space and the latter the Borel-convex subsets of finite dimensional Banach spaces. We show by introducing the corresponding separation trees that both of these results admit a constructive proof. This enables us to give the uniform version of the separation theorems, and derive as corollaries the results, which are analogous to the fundamental fact "HYP is effectively bi-analytic" provided by the Souslin-Kleene Theorem.

math.LO↗
arXiv2017

Classes of Polish spaces under effective Borel isomorphism

We study the equivalence classes under $Δ^1_1$ isomorphism, otherwise effective-Borel isomorphism, between complete separable metric spaces which admit a recursive presentation and we show the existence of strictly increasing and strictly decreasing sequences as well as of infinite antichains under the natural notion of $Δ^1_1$-reduction, as opposed to the non-effective case, where only two such classes exist, the one of the Baire space and the one of the naturals. A key tool for our study is a mapping $T \mapsto \mathcal{N}^T$ from the space of all trees on the naturals to the class of Polish spaces, for which every recursively presented space is $Δ^1_1$-isomorphic to some $\mathcal{N}^T$ for a recursive $T$, so that the preceding spaces are representatives for the classes of $Δ^1_1$-isomorphism. We isolate two large categories of spaces of the type $\mathcal{N}^T$, the Kleene spaces and the Spector-Gandy spaces and we study them extensively. Moreover we give results about hyperdegrees in the latter spaces and characterizations of the Baire space up to $Δ^1_1$-isomorphism.

math.LO↗
arXiv2017

Choice free Fixed Point Property in separable Banach spaces

We show that the standard approach of minimal invariant sets, which applies Zorn's Lemma and is used to prove fixed point theorems for non-expansive mappings in Banach spaces can be applied without any reference to the full Axiom of Choice when the given Banach space is separable. Our method applies results from classical and effective descriptive set theory.

math.LO↗
arXiv2016

Turing degrees in Polish spaces and decomposability of Borel functions

We give a partial answer to an important open problem in descriptive set theory, the Decomposability Conjecture for Borel functions on an analytic subset of a Polish space to a separable metrizable space. Our techniques employ deep results from effective descriptive set theory and recursion theory. In fact it is essential to extend several prominent results in recursion theory (\eg the Shore-Slaman Join Theorem) to the setting of Polish spaces. As a by-product we give both positive and negative results on the Martin Conjecture on the degree preserving Borel functions between Polish spaces. Additionally we prove results about the transfinite version as well as the computable version of the Decomposability Conjecture, and we explore the idea of applying the technique of turning Borel-measurable functions into continuous ones.

math.LO↗
arXiv2015

A comparison of concepts from computable analysis and effective descriptive set theory

Computable analysis and effective descriptive set theory are both concerned with complete metric spaces, functions between them and subsets thereof in an effective setting. The precise relationship of the various definitions used in the two disciplines has so far been neglected, a situation this paper is meant to remedy. As the role of the Cauchy completion is relevant for both effective approaches to Polish spaces, we consider the interplay of effectivity and completion in some more detail.

cs.LO↗
arXiv2012

Turning Borel sets into clopen sets effectively

We present the effective version of the theorem about turning Borel sets in Polish spaces into clopen sets while preserving the Borel structure of the underlying space. We show that under some conditions the emerging parameters can be chosen in a hyperarithmetical way and using this we prove a uniformity result.

math.LO↗
arXiv2011

The descriptive set-theoretic complexity of the set of points of continuity of a multi-valued function

In this article we treat a notion of continuity for a multi-valued function $F$ and we compute the descriptive set-theoretic complexity of the set of all $x$ for which $F$ is continuous at $x$. We give conditions under which the latter set is either a $G_δ$ set or the countable union of $G_δ$ sets. Also we provide a counterexample which shows that the latter result is optimum under the same conditions. Moreover we prove that those conditions are necessary in order to obtain that the set of points of continuity of $F$ is Borel i.e., we show that if we drop some of the previous conditions then there is a multi-valued function $F$ whose graph is a Borel set and the set of points of continuity of $F$ is not a Borel set. Finally we give some analogous results regarding a stronger notion of continuity for a multi-valued function. This article is motivated by a question of M. Ziegler in [{\em Real Computation with Least Discrete Advice: A Complexity Theory of Nonuniform Computability with Applications to Linear Algebra}, {\sl submitted}].

math.LO↗
arXiv2010

The descriptive set-theoretic complexity of the set of points of continuity of a multi-valued function (Extended Abstract)

In this article we treat a notion of continuity for a multi-valued function F and we compute the descriptive set-theoretic complexity of the set of all x for which F is continuous at x. We give conditions under which the latter set is either a G_δset or the countable union of G_δsets. Also we provide a counterexample which shows that the latter result is optimum under the same conditions. Moreover we prove that those conditions are necessary in order to obtain that the set of points of continuity of F is Borel i.e., we show that if we drop some of the previous conditions then there is a multi-valued function F whose graph is a Borel set and the set of points of continuity of F is not a Borel set. Finally we give some analogue results regarding a stronger notion of continuity for a multi-valued function. This article is motivated by a question of M. Ziegler in "Real Computation with Least Discrete Advice: A Complexity Theory of Nonuniform Computability with Applications to Linear Algebra", (submitted).

cs.CC↗