We study the uniform computational content of the Vitali Covering Theorem for intervals using the tool of Weihrauch reducibility. We show that a more detailed picture emerges than what a related study by Giusto, Brown, and Simpson has revealed in the setting of reverse mathematics. In particular, different formulations of the Vitali Covering Theorem turn out to have different uniform computational content. These versions are either computable or closely related to uniform variants of Weak Weak König’s Lemma.

The Vitali Covering Theorem in the Weihrauch Lattice

GHERARDI, GUIDO;
2017

Abstract

We study the uniform computational content of the Vitali Covering Theorem for intervals using the tool of Weihrauch reducibility. We show that a more detailed picture emerges than what a related study by Giusto, Brown, and Simpson has revealed in the setting of reverse mathematics. In particular, different formulations of the Vitali Covering Theorem turn out to have different uniform computational content. These versions are either computable or closely related to uniform variants of Weak Weak König’s Lemma.
2017
Computability and Complexity
188
200
Vasco Brattka; Guido Gherardi; Rupert Hölzl; Arno Pauly
File in questo prodotto:
File Dimensione Formato  
Gherardi-LNCS -1.pdf

accesso aperto

Tipo: Postprint
Licenza: Licenza per accesso libero gratuito
Dimensione 561.4 kB
Formato Adobe PDF
561.4 kB Adobe PDF Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11585/577646
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 6
  • ???jsp.display-item.citation.isi??? 5
social impact