On the (semi)lattices induced by continuous reducibilities

On the (semi)lattices induced by continuous reducibilities

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 t...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Mathematical logic quarterly 2010-10, Vol.56 (5), p.488-502
1. Verfasser: Pauly, Arno
Format: Artikel
Sprache:eng
Schlagworte:
category theory
Computable analysis
continuous reducibility
Weihrauch-reducibility
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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)
ISSN:0942-5616
1521-3870
DOI:10.1002/malq.200910104