17 citations · 51 across the 25 of their papers we have counts for
6 papers · 1 filter
A new proof of a theorem of Jayne and Rogers
Luca Motto Ros, Brian Semmes
We give a new simpler proof of a theorem of Jayne and Rogers.
The descriptive set-theoretical complexity of the embeddability relation on models of large size
Luca Motto Ros
We show that if κ is a weakly compact cardinal then the embeddability relation on (generalized) trees of size κ is invariantly universal. This means that for every analytic quasi-o…
Some observations on "A new proof of a theorem of Jayne and Rogers"
Miroslav Kačena, Luca Motto Ros, Brian Semmes
We adapt a construction taken from `L. Motto Ros and B. Semmes, A new proof of a theorem of Jayne and Rogers, Real Anal. Exchange 35(1) (2009/2010), 195-204' in order to correct a…
On the complexity of the relations of isomorphism and bi-embeddability
Luca Motto Ros
Given an L_{ω_1 ω}-elementary class C, that is the collection of the countable models of some L_{ω_1 ω}-sentence, denote by \cong_C and \equiv_C the analytic equivalence relations…
Analytic equivalence relations and bi-embedability
Sy-David Friedman, Luca Motto Ros
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 B…
Game representations of classes of piecewise definable functions
Luca Motto Ros
We present a general way of defining various reduction games on ω which "represent" corresponding topologically defined classes of functions. In particular, we will show how to con…