Beyond Borel-amenability: scales and superamenable reducibilities

Annals of Pure and Applied Logic 161 (7):829-836 (2010)
  Copy   BIBTEX

Abstract

We analyze the degree-structure induced by large reducibilities under the Axiom of Determinacy. This generalizes the analysis of Borel reducibilities given in Alessandro Andretta and Donald A. Martin [1], Luca Motto Ros [6] and Luca Motto Ros. [5] e.g. to the projective levels

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2009.10.001

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 106,951

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Beyond Borel-amenability: Scales and superamenable reducibilities.L. Ros - 2010 - Annals of Pure and Applied Logic 161 (7):829-836.
Baire reductions and good Borel reducibilities.Luca Motto Ros - 2010 - Journal of Symbolic Logic 75 (1):323-345.
Uncountable structures are not classifiable up to bi-embeddability.Filippo Calderoni, Heike Mildenberger & Luca Motto Ros - 2019 - Journal of Mathematical Logic 20 (1):2050001.
Borel-amenable reducibilities for sets of reals.Luca Motto Ros - 2009 - Journal of Symbolic Logic 74 (1):27-49.
The descriptive set-theoretical complexity of the embeddability relation on models of large size.Luca Motto Ros - 2013 - Annals of Pure and Applied Logic 164 (12):1454-1492.
The descriptive set-theoretical complexity of the embeddability relation on models of large size.Luca Ros - 2013 - Annals of Pure and Applied Logic 164 (12):1454-1492.
On sparseness, reducibilities, and complexity.Felipe Cucker - 2005 - Annals of Pure and Applied Logic 134 (1):53-61.
Nondeterministic bounded query reducibilities.Richard Beigel, William Gasarch & Jim Owings - 1989 - Annals of Pure and Applied Logic 41 (2):107-118.
Strong reducibilities and set theory.Noah Schweber - 2025 - Annals of Pure and Applied Logic 176 (2):103522.
Embeddings in the Strong Reducibilities Between 1 and npm.Phil Watson - 1997 - Mathematical Logic Quarterly 43 (4):559-568.

Analytics

Added to PP
2013-12-18

Downloads
55 (#438,710)

6 months
7 (#634,630)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Borel-amenable reducibilities for sets of reals.Luca Motto Ros - 2009 - Journal of Symbolic Logic 74 (1):27-49.
Continuous reducibility and dimension of metric spaces.Philipp Schlicht - 2018 - Archive for Mathematical Logic 57 (3-4):329-359.
Game representations of classes of piecewise definable functions.Luca Motto Ros - 2011 - Mathematical Logic Quarterly 57 (1):95-112.

Add more citations

References found in this work

[Omnibus Review].Yiannis N. Moschovakis - 1968 - Journal of Symbolic Logic 33 (3):471-472.
Borel-amenable reducibilities for sets of reals.Luca Motto Ros - 2009 - Journal of Symbolic Logic 74 (1):27-49.
Baire reductions and good Borel reducibilities.Luca Motto Ros - 2010 - Journal of Symbolic Logic 75 (1):323-345.

Add more references