# Lebesgue Integral in Constructive Analysis

Chapter

## Abstract

In the present note it is assumed that the reader is acquainted with [1]. We shall understand algorithms to be normal algorithms in the alphabet of constructive real numbers (CRN), extended by the letters Δ, □, β. Let n be a natural number, n ≥ 1. We shall call n-points words of the form x
where x

_{1}□x_{2}□...□x_{n}, where all the x_{i}(1 ≤ i ≤ n) are CRN from 0 Δ 1 and we shall call n-segments, words of the form$$x_1^1 \vartriangle \,x_1^2 \,\square \,x_2^1 \,\vartriangle \,x_2^2 \,\square \cdots \square \,\,x_n^1 \vartriangle \,x_n^2 ,$$

(1)

_{j}^{1}, x_{j}^{2}are CRN from 0Δ1, such that x_{j}^{1}< x_{j}^{2}(1 ≤j ≤ n).## Keywords

Natural Number Real Variable Consultant Bureau Present Note Constructive Theory
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

## Preview

Unable to display preview. Download preview PDF.

## Literature Cited

- 1.Demuth, O., “On Lebesgue integration in constructive analysis,” Doklady Akad. Nauk SSSR, 160(6): 1239–1241 (1965).Google Scholar

## Copyright information

© Consultants Bureau 1969