On the (semi)lattices induced by continuous reducibilities
Logic in Computer Science
2010-10-22 v2
Abstract
Continuous reducibilities are a proven tool in computable analysis, and have applications in other fields such as constructive mathematics or reverse mathematics. We study the order-theoretic properties of several variants of the two most important definitions, and especially introduce suprema for them. The suprema are shown to commutate with several characteristic numbers.
Cite
@article{arxiv.0903.2177,
title = {On the (semi)lattices induced by continuous reducibilities},
author = {Arno Pauly},
journal= {arXiv preprint arXiv:0903.2177},
year = {2010}
}
Comments
this version of the paper is outdated, please consult the journal version