On $\ell^{p}$-like equivalence relations
Logic
2009-11-17 v1 Combinatorics
Abstract
For , consider the relation on defined by We study the Borel reducibility of Borel equivalence relations of the form . Our results indicate that for every , the order of Borel reducibility on the set of equivalence relations is more complicated than expected, e.g. consistently every linear order of cardinality continuum embeds into it.
Cite
@article{arxiv.0911.2778,
title = {On $\ell^{p}$-like equivalence relations},
author = {Tamás Mátrai},
journal= {arXiv preprint arXiv:0911.2778},
year = {2009}
}