On the (semi)lattices induced by continuous reducibilities |
| |
| Authors: | Arno Pauly |
| |
| Institution: | Computer Laboratory, University of Cambridge, Cambridge CB3 0FD, United Kingdom |
| |
| 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 (© 2010 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim) |
| |
| Keywords: | Computable analysis continuous reducibility Weihrauch‐reducibility category theory |
|
|
