Results 1 
5 of
5
A Constructive Proof of the HeineBorel Covering Theorem for Formal Reals
, 1996
"... The continuum is here presented as a formal space by means of a finitary inductive definition. In this setting a constructive proof of the HeineBorel covering theorem is given. 1 Introduction It is well known that the usual classical proofs of the HeineBorel covering theorem are not acceptable fr ..."
Abstract

Cited by 9 (4 self)
 Add to MetaCart
The continuum is here presented as a formal space by means of a finitary inductive definition. In this setting a constructive proof of the HeineBorel covering theorem is given. 1 Introduction It is well known that the usual classical proofs of the HeineBorel covering theorem are not acceptable from a constructive point of view (cf. [vS, F]). An intuitionistic alternative proof that relies on the fan theorem was given by Brouwer (cf. [B, H]). In view of the relevance of constructive mathematics for computer science, relying on the connection between constructive proofs and computations, it is natural to look for a completely constructive proof of the theorem in its most general form, namely for intervals with realvalued endpoints. By using formal topology the continuum, as well as the closed intervals of the real line, can be defined by means of finitary inductive definitions. This approach allows a proof of the HeineBorel theorem that, besides being constructive, can also be compl...
A Pointfree approach to Constructive Analysis in Type Theory
, 1997
"... The first paper in this thesis presents a machine checked formalisation, in MartinLöf's type theory, of pointfree topology with applications to domain theory. In the other papers pointfree topology is used in an approach to constructive analysis. The continuum is defined as a formal space from ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
The first paper in this thesis presents a machine checked formalisation, in MartinLöf's type theory, of pointfree topology with applications to domain theory. In the other papers pointfree topology is used in an approach to constructive analysis. The continuum is defined as a formal space from a base of rational intervals. Then the closed rational interval [a, b] is defined as a formal space, in terms of the continuum, and the HeineBorel covering theorem is proved constructively. The basic definitions for a pointfree approach to functional analysis are given in such a way that the linear functionals from a seminormed linear space to the reals are points of a particular formal space, and in this setting the Alaoglu and the HahnBanach theorems are proved in an entirely constructive way. The proofs have been carried out in intensional MartinLöf type theory with one universe and finitary inductive definitions, and the proofs have also been mechanically checked in an implementation of that system. ...
The HahnBanach Theorem in Type Theory
, 1997
"... We give the basic deønitions for pointfree functional analysis and present constructive proofs of the Alaoglu and HahnBanach theorems in the setting of formal topology. 1 Introduction We present the basic concepts and deønitions needed in a pointfree approach to functional analysis via formal topol ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
We give the basic deønitions for pointfree functional analysis and present constructive proofs of the Alaoglu and HahnBanach theorems in the setting of formal topology. 1 Introduction We present the basic concepts and deønitions needed in a pointfree approach to functional analysis via formal topology. Our main results are the constructive proofs of localic formulations of the Alaoglu and HellyHahnBanach 1 theorems. Earlier pointfree formulations of the HahnBanach theorem, in a topostheoretic setting, were presented by Mulvey and Pelletier (1987,1991) and by Vermeulen (1986). A constructive proof based on points was given by Bishop (1967). In the formulation of his proof, the norm of the linear functional is preserved to an arbitrary degree by the extension and a counterexample shows that the norm, in general, is not preserved exactly. As usual in pointfree topology, our guideline is to deøne the objects under analysis as formal points of a suitable formal space. After this has...
Maximal and Partial Points in Formal Spaces
, 2002
"... this paper that if a formal topology S is setpresented, in the sense of Aczel, and has only maximal points, then the collection of its points Pt(S) is isomorphic to a set. This generalises a result by Curi (2001) on setrepresentability. The crucial result (Theorem 4.3) is that any suitably small su ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
this paper that if a formal topology S is setpresented, in the sense of Aczel, and has only maximal points, then the collection of its points Pt(S) is isomorphic to a set. This generalises a result by Curi (2001) on setrepresentability. The crucial result (Theorem 4.3) is that any suitably small subset of a point can be extended to a point picked from a prescribed small power set. This power set depends only on the data of the formal space. The proof involves what seems to be a new choice principle (Theorem 4.2). It is a generalisation of dependent choice from natural numbers to Wtypes and is provable in type theory
An Implementation of the HeineBorel Covering Theorem in Type Theory
"... Abstract. We describe an implementation, in type theory, of a proof of apointfree formulation of the HeineBorel covering theorem for intervals with rational endpoints. 1 ..."
Abstract
 Add to MetaCart
Abstract. We describe an implementation, in type theory, of a proof of apointfree formulation of the HeineBorel covering theorem for intervals with rational endpoints. 1