On Vitali's covering theorem (Q1935333)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6136423
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On Vitali's covering theorem |
scientific article; zbMATH DE number 6136423 |
Statements
On Vitali's covering theorem (English)
0 references
14 February 2013
0 references
The authors present a fascinating discussion of the Vitali covering theorem, its origin, history, and proofs, with considerable focus on Vitali's original algorithmic proof. It is noteworthy that recent work of \textit{H. Diener} and \textit{A. Hedin} [J. Log. Anal. 4, Article 7, 22 p. (2012; Zbl 1291.03114)], which would have been unavailable at the time the paper under review was written, deals with a detailed constructive analysis of the Vitali covering theorem.
0 references
0 references
0.8132786154747009
0 references
0.7786405682563782
0 references
0.762778639793396
0 references
0.7566888928413391
0 references
