On the Computational Content of Moduli of Regularity and their Logical Strength
Fuente:
arXiv
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Preprint |
| Publié: |
2026
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866914368529104896 |
|---|---|
| author | Kohlenbach, Ulrich |
| author_facet | Kohlenbach, Ulrich |
| contents | We continue the investigation into the computational status of the existence of moduli of regularity (and their use for rates of convergence) in the sense of Kohlenbach, Lopez and Nicolae (2019), carried out w.r.t. classical reverse mathematics and Weihrauch degrees in a previous paper and determine the amount of LEM involved. We also show that the existence of a modulus of regularity always yields an algorithm for the computation of a zero in the case of continuous real-valued functions F on a compact metric space K (in F equipped with a modulus of uniform continuity and K given in standard representation) whenever such a zero exists. If K is a compact subset of a uniformly convex Banach space X and the zero set of F is convex one can compute even the zero of minimal norm. A modulus of regularity can also be used to compute the left-most infinite path of an infinite 0/1-tree. We also show that there is no proof-theoretically tame nonstandard uniformity principle which would make it possible to replace in the regularity assumption compactness by metric boundedness and still guarantee classically correct bounds. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_04016 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | On the Computational Content of Moduli of Regularity and their Logical Strength Kohlenbach, Ulrich Logic in Computer Science We continue the investigation into the computational status of the existence of moduli of regularity (and their use for rates of convergence) in the sense of Kohlenbach, Lopez and Nicolae (2019), carried out w.r.t. classical reverse mathematics and Weihrauch degrees in a previous paper and determine the amount of LEM involved. We also show that the existence of a modulus of regularity always yields an algorithm for the computation of a zero in the case of continuous real-valued functions F on a compact metric space K (in F equipped with a modulus of uniform continuity and K given in standard representation) whenever such a zero exists. If K is a compact subset of a uniformly convex Banach space X and the zero set of F is convex one can compute even the zero of minimal norm. A modulus of regularity can also be used to compute the left-most infinite path of an infinite 0/1-tree. We also show that there is no proof-theoretically tame nonstandard uniformity principle which would make it possible to replace in the regularity assumption compactness by metric boundedness and still guarantee classically correct bounds. |
| title | On the Computational Content of Moduli of Regularity and their Logical Strength |
| topic | Logic in Computer Science |
| url | https://arxiv.org/abs/2603.04016 |