Skip to main content
Springer Nature - PMC COVID-19 Collection logoLink to Springer Nature - PMC COVID-19 Collection
. 2020 Jun 24;12098:215–227. doi: 10.1007/978-3-030-51466-2_19

Functions of Baire Class One over a Bishop Topology

Iosif Petrakis 5,
Editors: Marcella Anselmo8, Gianluca Della Vedova9, Florin Manea10, Arno Pauly11
PMCID: PMC7309499

Abstract

If Inline graphic is a topology of open sets on a set X, a real-valued function on X is of Baire class one over Inline graphic, if it is the pointwise limit of a sequence of functions in the corresponding ring of continuous functions C(X). If F is a Bishop topology of functions on X, a constructive and function-theoretic alternative to Inline graphic introduced by Bishop, we define a real-valued function on X to be of Baire class one over F, if it is the pointwise limit of a sequence of functions in F. We show that the set Inline graphic of functions of Baire class one over a given Bishop topology F on a set X is a Bishop topology on X. Consequently, notions and results from the general theory of Bishop spaces are naturally translated to the study of Baire class one-functions. We work within Bishop’s informal system of constructive mathematics Inline graphic, that is Inline graphic extended with inductive definitions with rules of countably many premises.

Introduction

If Inline graphic is a topology of open sets on a set X, a function Inline graphic is of Baire class one over Inline graphic, if it is the pointwise limit of a sequence of functions in the corresponding ring of continuous functions C(X). Such functions, which may no longer be in C(X), were introduced by Baire in [2], suggesting the use of functions, instead of sets, to tackle problems of real analysis. If Inline graphic, and if Inline graphic is the set of all Baire class one-functions, one defines for every ordinal Inline graphic, where Inline graphic is the first uncountable ordinal Inline graphic, the set

graphic file with name M15.gif

where, if Inline graphic is the set of real-valued functions on X, Inline graphic, and Inline graphic denotes that f is the pointwise limit of Inline graphic, we set

graphic file with name M20.gif

The theory of Baire class-functions is a function-theoretic version of the theory of Baire sets i.e., of sets the characteristic function of which is in some Baire class1. Generalisations of Baire class functions between metrizable spaces are central objects of study in descriptive set theory (see e.g., [13, 14]), with Baire class one-functions having applications to the theory of Banach spaces (see e.g., [9]).

The theory of Bishop spaces (TBS) is a function-theoretic approach to constructive topology within Bishop’s informal system of constructive mathematics Inline graphic. The fundamental notion of a function space, here called a Bishop space, was only introduced by Bishop in [3], p. 71. The subject was revived much later by Bridges in [5], where the notion of a Bishop morphism was also defined, and by Ishihara in [11]. In [1827] we try to develop TBS.

A Bishop topology of functions F on a set X is a set of real-valued functions defined on X that satisfies the main properties of the set of all Bishop continuous functions from Inline graphic to Inline graphic. A function Inline graphic is called (Bishop) continuous, if it is uniformly continuous on every bounded subset B of Inline graphic i.e., if for every bounded subset2 B of Inline graphic and for every Inline graphic there exists Inline graphic such that

graphic file with name M29.gif

where the function Inline graphic Inline graphic, is called a modulus of continuity for Inline graphic on B. Their set is denoted by Inline graphic, and two functions Inline graphic are equal, if Inline graphic, for every Inline graphic. The restriction of this notion of continuity to a compact interval [ab] of Inline graphic is equivalent to uniform continuity. By using this stronger notion of continuity, rather than the standard pointwise continuity, Bishop managed to avoid the use of fan theorem in the proof of the uniform continuity theorem and to remain “neutral” with respect to classical mathematics Inline graphic, intuitionistic mathematics Inline graphic, and intuitionistic computable mathematics Inline graphic.

Extending our work [22], where the Baire sets over a Bishop topology F are studied, here we give an introduction to the constructive theory of Baire class one-functions over a Bishop topology. In analogy to the classical concept, if F is a Bishop topology on a set X, we define a function Inline graphic to be of Baire class one over F, if it is the pointwise limit of a sequence of functions in F. Our constructive translation of the fundamentals of the classical theory of Baire class one-functions (see e.g., [10]) within Inline graphic is summarized by Theorem 1, according to which the set Inline graphic of Baire class one-functions over F is a Bishop topology on X that includes F. As we explain in Sect. 5, and based on the examples of Baire class one-functions included in Sect. 4, this result offers a way to study constructively classically discontinuous functions.

We work within Inline graphic, that is Inline graphic extended with inductive definitions with rules of countably many premises. A formal system for Inline graphic is Myhill’s system Inline graphic, developed in [17], or Inline graphic with dependence choice3 (see [6], p. 12), and some very weak form of Aczel’s regular extension axiom (see [1]).

Fundamentals of Bishop Spaces

In this section we include all definitions and facts necessary to the rest of the paper. All proofs not given given here are found in [18].

If Inline graphic, let Inline graphic and Inline graphic. Hence, Inline graphic. If Inline graphic, let Inline graphic, where for all definitions related to Inline graphic see [4], chapter 2. If Inline graphic and Inline graphic, the pointwise convergence Inline graphic and the uniform convergence Inline graphic on Inline graphic are defined, respectively, by

graphic file with name M61.gif
graphic file with name M62.gif
graphic file with name M63.gif

A set X is inhabited, if it has an element. We denote by Inline graphic, or simply by a, the constant function on X with value Inline graphic, and by Inline graphic their set.

Definition 1

A Bishop space is a pair Inline graphic, where X is an inhabited set and F is an extensional subset of Inline graphic i.e., Inline graphic, such that the following conditions hold:

Inline graphic Inline graphic.

Inline graphic If Inline graphic, then Inline graphic.

Inline graphic If Inline graphic and Inline graphic, then Inline graphic.

Inline graphic If Inline graphic and Inline graphic such that Inline graphic on X, then Inline graphic.

We call F a Bishop topology on X. If Inline graphic is a Bishop space, a Bishop morphism from Inline graphic to Inline graphic is a function Inline graphic such that Inline graphic. We denote by Inline graphic the set of Bishop morphisms from Inline graphic to Inline graphic. If Inline graphic, we say that h is open, if Inline graphic.

A Bishop morphism Inline graphic is a “continuous” function from Inline graphic to Inline graphic. If Inline graphic is a bijection, then Inline graphic i.e., h is a Bishop isomorphism, if and only if h is open. Let Inline graphic be the Bishop space of reals Inline graphic. It is easy to show that if F is a topology on X, then Inline graphic i.e., an element of F is a real-valued “continuous” function on X. A Bishop topology F on X is an algebra and a lattice, where Inline graphic and Inline graphic are defined pointwise, and Inline graphic. If Inline graphic denotes the bounded elements of Inline graphic, then Inline graphic is a Bishop topology on X. If Inline graphic is the given equality on X, a Bishop topology F on X separates the points of X, or F is completely regular (see [19] for their importance in the theory of Bishop spaces), if

graphic file with name M109.gif

In Proposition 5.1.3. of [18] it is shown that F separates the points of X if and only if the induced by F apartness relation on X

graphic file with name M110.gif

is tight i.e., Inline graphic. We use the last result in the proof of Proposition 1(iv). An apartness relation on X is a positively defined inequality on X. E.g., if Inline graphic, then Inline graphic. In Proposition 5.1.2. of [18] we show that Inline graphic.

Definition 2

Turning the definitional clauses Inline graphic into inductive rules, the least topology Inline graphic generated by a set Inline graphic, called a subbase of Inline graphic, is defined by the following inductive rules:

graphic file with name M119.gif
graphic file with name M120.gif

where the last rule is reduced to the following rule with countably many premisses

graphic file with name M121.gif

The above rules induce the corresponding induction principle Inline graphic on Inline graphic. If Inline graphic, the relative topology Inline graphic on A has the set Inline graphic as a subbase. Unless otherwise stated, from now on, XY are inhabited sets, and FG are Bishop topologies on X and Y, respectively.

The Bishop Topology of Baire Class One-Functions

Definition 3

A function Inline graphic is called of Baire class one over F, or simply of Baire class one when F is clear from the context, if there is a sequence Inline graphic such that Inline graphic on X. We denote their set by Inline graphic.

Lemma 1

Let Inline graphic and Inline graphic with Inline graphic. If Inline graphic, there is Inline graphic, such that Inline graphic

Proof

Let Inline graphic such that if Inline graphic, then Inline graphic, hence Inline graphic. If Inline graphic then Inline graphic, for every Inline graphic, and Inline graphic.

Lemma 2

If Inline graphic and Inline graphic, then Inline graphic.

Proof

Let Inline graphic such that Inline graphic. If Inline graphic and Inline graphic are fixed, there is Inline graphic such that for every Inline graphic we have that Inline graphic. Since Inline graphic, for every Inline graphic, and Inline graphic, by the uniform continuity of Inline graphic we have that

graphic file with name M159.gif

Hence, for every Inline graphic we have that Inline graphic. Since Inline graphic is arbitrary, we get Inline graphic. Since Inline graphic is arbitrary, we get Inline graphic.

Note that Inline graphic is not a distributive lattice, since not even Inline graphic is one. For the properties of Inline graphic and Inline graphic used in the next proof see [7], p. 52.

Lemma 3

If Inline graphic and Inline graphic, the following hold.

(i) If Inline graphic, then Inline graphic and Inline graphic.

(ii) Inline graphic.

Proof

(i) Since Inline graphic, we get Inline graphic. Since also Inline graphic, we get Inline graphic. Since Inline graphic, and since also Inline graphic, we get Inline graphic.

(ii) By Corollary 2.17 in [4], p. 26, Inline graphic or Inline graphic. If Inline graphic, then Inline graphic and, since Inline graphic we also get Inline graphic, hence Inline graphic. If Inline graphic, and since also Inline graphic, we get Inline graphic, hence Inline graphic. Moreover, Inline graphic and the required equality holds.

Lemma 4

If Inline graphic is bounded by some Inline graphic, there is a sequence Inline graphic such that Inline graphic and Inline graphic is bounded by M, for every Inline graphic.

Proof

If Inline graphic such that Inline graphic, let Inline graphic, for every Inline graphic. We show that Inline graphic. Let Inline graphic, Inline graphic and Inline graphic, such that for every Inline graphic we have that Inline graphic, or equivalently Inline graphic By Lemma 3(i), and since Inline graphic, we get

graphic file with name M213.gif

Hence

graphic file with name M214.gif

i.e., Inline graphic. Since Inline graphic, by Lemma 3(i) we get Inline graphic. Since Inline graphic, we get Inline graphic hence by Lemma 3(ii) we get

graphic file with name M220.gif

i.e., Inline graphic, which implies Inline graphic. Since we have already shown that Inline graphic, by the definition of Inline graphic we conclude that Inline graphic, for every Inline graphic. Of course, Inline graphic, for every Inline graphic.

The proofs of the following two lemmas for Inline graphic (see [8]) are constructive.

Lemma 5

Let Inline graphic and Inline graphic with Inline graphic, for every Inline graphic, and Inline graphic. If Inline graphic, for every Inline graphic, then Inline graphic

Proof

Since Inline graphic is bounded by Inline graphic, for every Inline graphic, by Lemma 4 there is Inline graphic with Inline graphic and Inline graphic. If Inline graphic, let Inline graphic Let Inline graphic. Since Inline graphic, there is Inline graphic with Inline graphic. If Inline graphic, there is Inline graphic, such that for every Inline graphic we have that Inline graphic, for every Inline graphic. If Inline graphic, then

graphic file with name M256.gif

Lemma 6

If Inline graphic and Inline graphic with Inline graphic, then Inline graphic.

Proof

Using dependent choice there is a subsequence Inline graphic of Inline graphic with Inline graphic, for every Inline graphic. Let Inline graphic If Inline graphic, then

graphic file with name M267.gif

By Lemma 5 we have that Inline graphic. Since

graphic file with name M269.gif

we get Inline graphic, as Inline graphic is trivially closed under addition.

Theorem 1

Inline graphic is a Bishop topology on X that includes F.

Proof

Inline graphic is an extensional subset of Inline graphic, since if Inline graphic and Inline graphic such that Inline graphic on X, then if Inline graphic, we also get Inline graphic on X. Clearly, Inline graphic, and hence Inline graphic. Moreover, Inline graphic is closed under addition. By Lemma 2 Inline graphic is closed under composition with elements of Inline graphic, and by Lemma 6 Inline graphic is closed under uniform limits.

By Theorem 1, if Inline graphic, then Inline graphic, and Inline graphic are in Inline graphic. These facts also follow trivially by the definition of Inline graphic. The importance of Theorem 1 though, is revealed by the use of the general theory of Bishop spaces in the proof of non-trivial properties of Inline graphic that, consequently, depend only on the Bishop space-structure of Inline graphic.

Corollary 1

(i) Inline graphic is a Bishop topology on X.

(ii) If Inline graphic such that Inline graphic, for some Inline graphic with Inline graphic, then Inline graphic.

(iii) If Inline graphic such that Inline graphic, then Inline graphic.

(iv) The collection Inline graphic of zero sets of Inline graphic, where Inline graphic, is closed under countable intersections.

(v) [Urysohn lemma for Inline graphic-zero sets] If Inline graphic, then there is Inline graphic with Inline graphic and Inline graphic if and only if there are Inline graphic, and Inline graphic. such that Inline graphic, Inline graphic, and Inline graphic.

(vi) [Urysohn extension theorem for Inline graphic Let Inline graphic such that Inline graphic, for every Inline graphic. If for every Inline graphic, whenever AB are separated by some function in Inline graphic, then AB are separated by some function in Inline graphic, then every Inline graphic is the restriction of some Inline graphic.

Proof

These facts follow from the corresponding facts on general Bishop spaces. See [18], p. 41, for (i), Theorem 5.4.8. in [18] for (ii), [26] for a proof of (iii), Proposition 5.3.3.(ii) in [18] for (iv), Theorem 5.4.9. in [18] for (v), and the Urysohn extension theorem for general Bishop spaces in [20] for (vi).

Corollary 1, except from case (iii), are classically shown in [8] specifically for Inline graphic. Notice that in [20] we avoid quantification over the powerset of Y in the formulation of the Urysohn extension theorem, formulating it predicatively.

Proposition 1

Let Inline graphic.

(i) If Inline graphic with Inline graphic, there is Inline graphic such that Inline graphic.

(ii) Inline graphic.

(iii) The apartness Inline graphic is tight if and only if the apartness Inline graphic is tight.

(iv) Inline graphic separates the points of X if and only if F separates them.

(v) Inline graphic separates the points of X if and only if Inline graphic separates them.

Proof

(i) Since Inline graphic, let the well-defined function

graphic file with name M337.gif

Inline graphic is in Inline graphic, Inline graphic and Inline graphic. If Inline graphic with Inline graphic, then

graphic file with name M344.gif

If Inline graphic, then Inline graphic with Inline graphic and Inline graphic, hence Inline graphic.

(ii) If Inline graphic, there is Inline graphic such that Inline graphic. By (i) we get Inline graphic. Conversely, if Inline graphic, there is Inline graphic with Inline graphic. Since f is also in Inline graphic, we get Inline graphic.

(iii) Let Inline graphic be tight. If Inline graphic, then by (ii) we get Inline graphic, hence Inline graphic. The converse implication is shown similarly.

(iv) It follows from (iii) and the result mentioned in Sect. 2 that a Bishop topology separates the points if and only if its induced apartness is tight.

(v) It follows from the general fact that F separates the points if and only if Inline graphic separates them (see Proposition 5.7.2. in [18]).

Proposition 2

Let Inline graphic and Inline graphic.

(i) If Inline graphic, then Inline graphic.

(ii) Let Inline graphic be a surjection with Inline graphic a modulus of surjectivity4 for h i.e., Inline graphic. If Inline graphic is open, then Inline graphic is open.

Proof

(i) We need to show that Inline graphic. If we fix Inline graphic, let Inline graphic such that Inline graphic. Then, we get Inline graphic. Since Inline graphic, we have that Inline graphic, for every Inline graphic, and hence Inline graphic.

(ii) By case (i) Inline graphic. By Definition 1, if Inline graphic, we prove Inline graphic. Let Inline graphic and Inline graphic with Inline graphic on X. By the principle of countable choice (see [6], p. 12) there is Inline graphic such that Inline graphic, for every Inline graphic. Let Inline graphic, defined by Inline graphic. First we show that Inline graphic. If Inline graphic, we show that

graphic file with name M395.gif

Since Inline graphic we get

graphic file with name M397.gif

i.e., Inline graphic for every Inline graphic. Since Inline graphic and Inline graphic, we get Inline graphic. Since Inline graphic is an extensional subset of Inline graphic and Inline graphic, we conclude that Inline graphic too. To prove Inline graphic, we show that Inline graphic. If Inline graphic, then

graphic file with name M410.gif

Since Inline graphic, we conclude that Inline graphic.

Examples of Functions of Baire Class One over F

First we find an unbounded Baire class one-function over some Bishop topology. If Inline graphic, let Inline graphic defined by

graphic file with name M415.gif

Clearly, Inline graphic, for every Inline graphic. If Inline graphic, then Inline graphic and Inline graphic, hence Inline graphic. If Inline graphic, then Inline graphic and Inline graphic, hence Inline graphic. Hence,

graphic file with name M426.gif

If Inline graphic, we consider the Bishop topology Inline graphic on Inline graphic. Let the function Inline graphic, defined by

graphic file with name M431.gif

Clearly, g is unbounded on its domain. We show that Inline graphic, hence Inline graphic. If Inline graphic, then Inline graphic. Let Inline graphic We fix some Inline graphic, and we find Inline graphic such that Inline graphic. Hence, if Inline graphic, then Inline graphic too. Since then Inline graphic and Inline graphic, we have that

graphic file with name M444.gif

A pseudo-compact Bishop topology is a topology all the elements of which are bounded functions. Since boundedness is a “liftable” property from Inline graphic to F i.e., if every Inline graphic is bounded, then every Inline graphic is bounded (see Proposition 3.4.4 in [18], p. 46), the topology Inline graphic of the previous example is pseudo-compact, and hence the above construction is also an example of an unbounded Baire-class one function over a pseudo-compact Bishop topology!

It is immediate to show that Inline graphic and Inline graphic. Next we find a Baire class one-function over some F that is not in F. Let Inline graphic be equipped with the relative Bishop topology Inline graphic, where Inline graphic is the Bishop topology of uniformly continuous functions on [0, 1], and Inline graphic, with Inline graphic being defined similarly to Inline graphic. Let Inline graphic, where Inline graphic, for every Inline graphic. By the definition of relative Bishop topology (see Definition 2) we have that Inline graphic, for every Inline graphic, and Inline graphic, where Inline graphic is given by

graphic file with name M464.gif

Since Y is dense in [0, 1], g is not in Inline graphic; if it was, by Proposition 4.7.15. in [18] we get Inline graphic with Inline graphic, which is impossible.

A similar example is the following. Let Inline graphic be equipped with the relative topology Inline graphic. If Inline graphic, let Inline graphic and Inline graphic. If Inline graphic,

graphic file with name M474.gif

Let Inline graphic be the restriction of Inline graphic to Z, for every Inline graphic. Clearly, Inline graphic, where

graphic file with name M479.gif

Since Z is dense in Inline graphic (see Lemma 2.2.8. of [18]), and arguing as in the previous example, h cannot be in the specified Bishop topology on Z.

As in the classical case, all derivatives of differentiable functions in Inline graphic are Baire class one-functions over Inline graphic. We reformulate the definition in [4], p. 44, as follows.

Definition 4

Let Inline graphic, Inline graphic (uniformly) continuous on [ab], and Inline graphic. We say that f is differentiable on [ab] with derivative Inline graphic and modulus of differentiability Inline graphic, in symbols Inline graphic, if

graphic file with name M489.gif

If Inline graphic, we say that Inline graphic is differentiable with derivative Inline graphic, in symbols Inline graphic, if for every Inline graphic we have that Inline graphic.

Proposition 3

If Inline graphic such that Inline graphic, then Inline graphic.

Proof

If Inline graphic, let Inline graphic. We show that Inline graphic. Let Inline graphic and Inline graphic. Let Inline graphic with Inline graphic. Since Inline graphic and Inline graphic, there is Inline graphic such that for every Inline graphic we have that Inline graphic and Inline graphic, hence Inline graphic and by Definition 4 we have that

graphic file with name M513.gif

Concluding Comments

In this paper we introduced the notion of a function of Baire class one over a Bishop topology F, translating a fundamental notion of classical real analysis and topology into the constructive topology of Bishop spaces. Our central result, that the set Inline graphic of Baire class one-functions over F is a Bishop topology that includes F, is used to apply concepts and results from the general theory of Bishop spaces to the theory of functions of Baire class one over a Bishop topology. These first applications suggest that the structure of Bishop space, treated classically, would also be useful to the classical study of function spaces like Inline graphic.

For constructive topology, the fact that Inline graphic is a Bishop topology provides a second way, within the theory of Bishop spaces, to treat classically discontinuous, real-valued functions as “continuous” i.e., as Bishop morphisms. The first way is to consider such discontinuous functions as elements of a subbase Inline graphic. Since by definition Inline graphic, the elements of Inline graphic are Bishop morphisms from the resulting least Bishop space Inline graphic to the Bishop space Inline graphic of reals. In [27], and based on a notion of convergence of test functions introduced by Ishihara, we follow this way to make the Dirac delta function Inline graphic and the Heaviside step function H “continuous”. We consider a certain set Inline graphic of linear maps on the test functions on Inline graphic, where Inline graphic, and the Bishop topology Inline graphic is used to define the set of distributions on Inline graphic. The second way, is to start from a Bishop topology F and find elements of Inline graphic i.e., Bishop morphisms from Inline graphic to Inline graphic, that are pointwise discontinuous, as the functions g and h in the last two example before Definition 4. This second way is sort of a constructive analogue to the classical result that the points of pointwise continuity of some Inline graphic is dense in Inline graphic, hence f is almost everywhere continuous.

There are numerous interesting questions stemming from this introductory work. Can we prove constructively that the characteristic function of a (complemented) Baire set Inline graphic over a Bishop topology F (see [22]) is a Baire class-one function over the relative topology Inline graphic? Can we show constructively other classical characterisations of Inline graphic, like for example through Inline graphic-sets? What is the exact relation between Inline graphic and Inline graphic, or between Inline graphic and the product Bishop topology (see [18], Sect. 4.1 for its definition) Inline graphic? How far can we go constructively with the study of Baire class two-functions?

A base of a Bishop topology F is a subset B of F such that every Inline graphic is the uniform limit of a sequence in B. If B is a base of F, it follows easily that

graphic file with name M542.gif

hence for the uniform closure Inline graphic of B in Inline graphic we get

graphic file with name M545.gif

i.e., Inline graphic is a base of Inline graphic. If Inline graphic is a subbase of F i.e., Inline graphic, we have that Inline graphic, hence Inline graphic. When does the inverse inclusion also hold?

We hope to address some of these questions in a future work.

Footnotes

1

For that see the Lebesgue-Hausdorff theorem in [15], p. 393, and Lorch’s comment in [16], p. 751, on the “coextension” of the two theories.

2

It suffices to say that Inline graphic is uniformly continuous on every interval Inline graphic, and the quantification over the powerset of Inline graphic is replaced by quantification over Inline graphic.

3

Here we use the principle of dependent choice in the proof of Lemma 6.

4

We use Inline graphic in order to avoid the general axiom of choice in the proof.

Contributor Information

Marcella Anselmo, Email: manselmo@unisa.it.

Gianluca Della Vedova, Email: gianluca.dellavedova@unimib.it.

Florin Manea, Email: flmanea@gmail.com.

Arno Pauly, Email: arno.m.pauly@gmail.com.

Iosif Petrakis, Email: petrakis@math.lmu.de.

References

  • 1.Aczel, P., Rathjen, M.: Constructive Set Theory, Book Draft (2010)
  • 2.Baire R-L. Sur les fonctions des variable réelles. Annali. Mat. 1899;3:1–123. doi: 10.1007/BF02419243. [DOI] [Google Scholar]
  • 3.Bishop E. Foundations of Constructive Analysis. New York City: McGraw-Hill; 1967. [Google Scholar]
  • 4.Bishop, E., Bridges, D.S.: Constructive Analysis, Grundlehren der math. Wissenschaften, vol. 279, Springer, Heidelberg (1985)
  • 5.Bridges DS. Reflections on function spaces. Ann. Pure Appl Log. 2012;163:101–110. doi: 10.1016/j.apal.2011.06.018. [DOI] [Google Scholar]
  • 6.Bridges DS, Richman F. Varieties of Constructive Mathematics. Cambridge: Cambridge University Press; 1987. [Google Scholar]
  • 7.Bridges DS, Vîţă LS. Techniques of Constructive Analysis. Springer, New York: Universitext; 2006. [Google Scholar]
  • 8.Deb Ray A, Mondal A. On rings of Baire one functions. Appl. Gen. Topol. 2019;20(1):237–249. doi: 10.4995/agt.2019.10776. [DOI] [Google Scholar]
  • 9.Haydon, R., Odell, E., Rosenthal, H.P.: Certain subsclasses of Baire-Inline graphic functions with Banach space applications. In: Longhorn Notes, University of Texas at Austin Functional Analysis Seminar (1987–1989)
  • 10.Hu, J.: Baire one functions, preprint
  • 11.Ishihara H. Relating Bishop’s function spaces to neighborhood spaces. Ann. Pure Appl. Log. 2013;164:482–490. doi: 10.1016/j.apal.2012.10.009. [DOI] [Google Scholar]
  • 12.Jayne, J.E.: Space of Baire functions. I, Annales de l’institut Fourier, pp. 47–76 (1974)
  • 13.Kechris AS, Louveau A. A classification of Baire class Inline graphic functions. Trans. Am. Math. Soc. 1990;318(1):209–236. [Google Scholar]
  • 14.Kechris AS. Classical Descriptive Set Theory. Heidelberg: Springer; 1995. [Google Scholar]
  • 15.Kuratowski K. Topology. New York: Academic Press; 1966. [Google Scholar]
  • 16.Lorch ER. Continuity and Baire functions. Am. Math. Monthly. 1971;78(7):748–762. doi: 10.1080/00029890.1971.11992845. [DOI] [Google Scholar]
  • 17.Myhill J. Constructive set theory. J. Symb. Log. 1975;40:347–382. doi: 10.2307/2272159. [DOI] [Google Scholar]
  • 18.Petrakis, I.: Constructive Topology of Bishop Spaces, Ph.D. Thesis, Ludwig-Maximilians-Universität, München (2015)
  • 19.Petrakis I. Completely regular Bishop spaces. In: Beckmann A, Mitrana V, Soskova M, editors. Evolving Computability; Cham: Springer; 2015. pp. 302–312. [Google Scholar]
  • 20.Petrakis I. The Urysohn extension theorem for Bishop spaces. In: Artemov S, Nerode A, editors. Logical Foundations of Computer Science; Cham: Springer; 2016. pp. 299–316. [Google Scholar]
  • 21.Petrakis, I.: A constructive function-theoretic approach to topological compactness. In: LICS, pp. 605–614 (2016)
  • 22.Petrakis I. Borel and Baire sets in Bishop spaces. In: Manea F, Martin B, Paulusma D, Primiero G, editors. Computing with Foresight and Industry; Cham: Springer; 2019. pp. 240–252. [Google Scholar]
  • 23.Petrakis I. Constructive uniformities of pseudometrics and Bishop topologies. J. Log. Anal. 2019;11(FT2):1–44. [Google Scholar]
  • 24.Petrakis, I.: Direct spectra of Bishop spaces and their limits. https://arxiv.org/abs/1907.03273 (2019)
  • 25.Petrakis I. Embeddings of Bishop spaces. J. Logi. Comput. 2020;30(1):349–379. doi: 10.1093/logcom/exaa015. [DOI] [Google Scholar]
  • 26.Petrakis, I.: A constructive theory of Inline graphic, preprint (2020)
  • 27.Petrakis, I.: Towards a constructive approach to the theory of distributions, preprint (2020)

Articles from Beyond the Horizon of Computability are provided here courtesy of Nature Publishing Group

RESOURCES