A computable version of the Daniell–Stone theorem on...

Theoretical Computer Science 2006 Vol. 359; Iss. 1-3

A computable version of the Daniell–Stone theorem on integration and linear functionals

Yongcheng Wu, Klaus Weihrauch
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
359
Year:
2006
Language:
english
Pages:
15
DOI:
10.1016/j.tcs.2006.01.050
File:
PDF, 292 KB
english, 2006
Conversion to is in progress
Conversion to is failed