22
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      Recursion and effectivity in the Decomposability Conjecture

      Preprint

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          Using ideas and results from recursion theory and effective descriptive set theory we provide a partial answer to the Decomposabilty Conjecture in Polish spaces of small inductive dimension. The latter extends earlier work of Motto Ros and Pawlikowski-Sabok. We also state a conjecture, which would allow our arguments to be carried out in all Polish spaces, and we give the analogous results in the transfinite case of the problem. Finally we present an approach to the later, where we utilize the technique of turning Borel-measurable functions into continuous ones.

          Related collections

          Author and article information

          Journal
          1410.1052

          Logic & Foundation
          Logic & Foundation

          Comments

          Comment on this article