Luca Motto Ros
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Luca Motto Ros has a total of 2 co-authors. Here are the top co-authors by number of shared publications:
- Sy-David Friedman
KURT GÖDEL RESEARCH CENTER FOR MATHEMATICAL LOGIC UNIVERSITY OF VIENNA VIENNA, AUSTRIA
2 shared publications - Brian Semmes1 shared publication
Latest Publications
- Open Access
A new proof of a theorem of Jayne and Rogers
We give a new simpler proof of a theorem of Jayne and Rogers.
Open AccessA new proof of a theorem of Jayne and Rogers
We give a new simpler proof of a theorem of Jayne and Rogers.
- Open Access
Analytic equivalence relations and bi-embedability
Louveau and Rosendal [5] have shown that the relation of bi-embeddability for countable graphs as well as for many other natural classes of countable structures is complete under Borel reducibility for analytic equivalence relations. This is in strong contrast to the case of the isomorphism relation, which as an equivalence relation on graphs (or on any class of countable structures consisting of the models of a sentence of L_{\omega_1 \omega}) is far from complete (see [5, 2]). In this article we strengthen the results of [5] by showing that not only does bi-embeddability give rise to analytic equivalence relations which are complete under Borel reducibility, but in fact any analytic equivalence relation is Borel equivalent to such a relation. This result and the techniques introduced answer questions raised in [5] about the comparison between isomorphism and bi-embeddability. Finally, as in [5] our results apply not only to classes of countable structures defined by sentences of L_{\omega_1 \omega}, but also to discrete metric or ultrametric Polish spaces, compact metrizable topological spaces and separable Banach spaces, with various notions of embeddability appropriate for these classes, as well as to actions of Polish monoids.
Open AccessAnalytic equivalence relations and bi-embedability
Louveau and Rosendal [5] have shown that the relation of bi-embeddability for countable graphs as well as for many other natural classes of countable structures is complete under Borel reducibility for analytic equivalence relations. This is in strong contrast to the case of the isomorphism relation, which as an equivalence relation on graphs (or on any class of countable structures consisting of the models of a sentence of L_{\omega_1 \omega}) is far from complete (see [5, 2]). In this article we strengthen the results of [5] by showing that not only does bi-embeddability give rise to analytic equivalence relations which are complete under Borel reducibility, but in fact any analytic equivalence relation is Borel equivalent to such a relation. This result and the techniques introduced answer questions raised in [5] about the comparison between isomorphism and bi-embeddability. Finally, as in [5] our results apply not only to classes of countable structures defined by sentences of L_{\omega_1 \omega}, but also to discrete metric or ultrametric Polish spaces, compact metrizable topological spaces and separable Banach spaces, with various notions of embeddability appropriate for these classes, as well as to actions of Polish monoids.
- 12 March 2011
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- Vol. 76 (1) , 243-266
Analytic equivalence relations and bi-embeddability
Louveau and Rosendal [5] have shown that the relation of bi-embeddability for countable graphs as well as for many other natural classes of countable structures is complete under Borel reducibility for analytic equivalence relations. This is in strong contrast to the case of the isomorphism relation, which as an equivalence relation on graphs (or on any class of countable structures consisting of the models of a sentence of ) is far from complete (see [5, 2]).In this article we strengthen the results of [5] by showing that not only does bi-embeddability give rise to analytic equivalence relations which are complete under Borel reducibility, but in fact any analytic equivalence relation is Borel equivalent to such a relation. This result and the techniques introduced answer questions raised in [5] about the comparison between isomorphism and bi-embeddability. Finally, as in [5] our results apply not only to classes of countable structures defined by sentences of , but also to discrete metric or ultrametric Polish spaces, compact metrizable topological spaces and separable Banach spaces, with various notions of embeddability appropriate for these classes, as well as to actions of Polish monoids.
- 12 March 2011
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- Vol. 76 (1) , 243-266
Analytic equivalence relations and bi-embeddability
Louveau and Rosendal [5] have shown that the relation of bi-embeddability for countable graphs as well as for many other natural classes of countable structures is complete under Borel reducibility for analytic equivalence relations. This is in strong contrast to the case of the isomorphism relation, which as an equivalence relation on graphs (or on any class of countable structures consisting of the models of a sentence of ) is far from complete (see [5, 2]).In this article we strengthen the results of [5] by showing that not only does bi-embeddability give rise to analytic equivalence relations which are complete under Borel reducibility, but in fact any analytic equivalence relation is Borel equivalent to such a relation. This result and the techniques introduced answer questions raised in [5] about the comparison between isomorphism and bi-embeddability. Finally, as in [5] our results apply not only to classes of countable structures defined by sentences of , but also to discrete metric or ultrametric Polish spaces, compact metrizable topological spaces and separable Banach spaces, with various notions of embeddability appropriate for these classes, as well as to actions of Polish monoids.
- Open Access
Beyond Borel-amenability: scales and superamenable reducibilities
We analyze the degree-structure induced by large reducibilities under the Axiom of Determinacy. This generalizes the analysis of Borel reducibilities given in references [1], [6] and [5] e.g. to the projective levels.
Open AccessBeyond Borel-amenability: scales and superamenable reducibilities
We analyze the degree-structure induced by large reducibilities under the Axiom of Determinacy. This generalizes the analysis of Borel reducibilities given in references [1], [6] and [5] e.g. to the projective levels.
- Open Access
Baire reductions and good Borel reducibilities
In reference [8] we have considered a wide class of "well-behaved" reducibilities for sets of reals. In this paper we continue with the study of Borel reducibilities by proving a dichotomy theorem for the degree-structures induced by good Borel reducibilities. This extends and improves the results of [8] allowing to deal with a larger class of notions of reduction (including, among others, the Baire class $\xi$ functions).Open AccessBaire reductions and good Borel reducibilities
In reference [8] we have considered a wide class of "well-behaved" reducibilities for sets of reals. In this paper we continue with the study of Borel reducibilities by proving a dichotomy theorem for the degree-structures induced by good Borel reducibilities. This extends and improves the results of [8] allowing to deal with a larger class of notions of reduction (including, among others, the Baire class $\xi$ functions). - 12 March 2010
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- Vol. 75 (1) , 323-345
Baire reductions and good Borel reducibilities
In [9] we have considered a wide class of “well-behaved” reducibilities for sets of reals. In this paper we continue with the study of Borel reducibilities by proving a dichotomy theorem for the degree-structures induced by good Borel reducibilities. This extends and improves the results of [9] allowing to deal with a larger class of notions of reduction (including, among others, the Baire class ξ functions).
- 12 March 2010
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- Vol. 75 (1) , 323-345
Baire reductions and good Borel reducibilities
In [9] we have considered a wide class of “well-behaved” reducibilities for sets of reals. In this paper we continue with the study of Borel reducibilities by proving a dichotomy theorem for the degree-structures induced by good Borel reducibilities. This extends and improves the results of [9] allowing to deal with a larger class of notions of reduction (including, among others, the Baire class ξ functions).
- 12 March 2009
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- Vol. 74 (1) , 27-49
Borel-amenable reducibilities for sets of reals
We show that if ℱ is any “well-behaved” subset of the Borel functions and we assume the Axiom of Determinacy then the hierarchy of degrees on (ωω) induced by ℱ turns out to look like the Wadge hierarchy (which is the special case where ℱ is the set of continuous functions).
- 12 March 2009
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- Vol. 74 (1) , 27-49
Borel-amenable reducibilities for sets of reals
We show that if ℱ is any “well-behaved” subset of the Borel functions and we assume the Axiom of Determinacy then the hierarchy of degrees on (ωω) induced by ℱ turns out to look like the Wadge hierarchy (which is the special case where ℱ is the set of continuous functions).
- Open Access
Borel-amenable Reducibilities for Sets of Reals
We show that if $\mathcal{F}$ is any "well-behaved" subset of the Borel functions and we assume the Axiom of Determinacy then the hierarchy of degrees on $\pow(\mathbb{R})$ induced by $\mathcal{F}$ turns out to look like the Wadge hierarchy (which is the special case where $\mathcal{F}$ is the set of continuous functions).Open AccessBorel-amenable Reducibilities for Sets of Reals
We show that if $\mathcal{F}$ is any "well-behaved" subset of the Borel functions and we assume the Axiom of Determinacy then the hierarchy of degrees on $\pow(\mathbb{R})$ induced by $\mathcal{F}$ turns out to look like the Wadge hierarchy (which is the special case where $\mathcal{F}$ is the set of continuous functions). - Open Access
A new characterization of Baire class 1 functions
We give a new characterization of the Baire class 1 functions (defined on an ultrametric space) by proving that they are exactly the pointwise limits of sequences of full functions (which are particularly simple Lipschitz functions). Moreover we highlight the link between the two classical stratifications of the Borel functions by showing that the Baire class functions of some level are exactly those obtained as uniform limits of sequences of Delta functions (of a corresponding level).
Open AccessA new characterization of Baire class 1 functions
We give a new characterization of the Baire class 1 functions (defined on an ultrametric space) by proving that they are exactly the pointwise limits of sequences of full functions (which are particularly simple Lipschitz functions). Moreover we highlight the link between the two classical stratifications of the Borel functions by showing that the Baire class functions of some level are exactly those obtained as uniform limits of sequences of Delta functions (of a corresponding level).