Results 11  20
of
24
Limit Spaces and Transfinite Types
, 1998
"... We give a characterisation of an extension of the KleeneKreisel continuous functionals to objects of transfinite types using limit spaces of transfinite types. ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
(Show Context)
We give a characterisation of an extension of the KleeneKreisel continuous functionals to objects of transfinite types using limit spaces of transfinite types.
TERM EXTRACTION AND RAMSEY’S THEOREM FOR PAIRS
"... Abstract. In this paper we study with prooftheoretic methods the function(al)s provably recursive relative to Ramsey’s theorem for pairs and the cohesive principle (COH). Our main result on COH is that the type 2 functionals provably recursive from RCA0 + COH + Π0 1CP are primitive recursive. This ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
Abstract. In this paper we study with prooftheoretic methods the function(al)s provably recursive relative to Ramsey’s theorem for pairs and the cohesive principle (COH). Our main result on COH is that the type 2 functionals provably recursive from RCA0 + COH + Π0 1CP are primitive recursive. This also provides a uniform method to extract bounds from proofs that use these principles. As a consequence we obtain a new proof of the fact that WKL0 + Π0 1CP + COH is Π0 2conservative over PRA. Recent work of the first author showed that Π0 1CP + COH is equivalent to a weak variant of the BolzanoWeierstraß principle. This makes it possible to use our results to analyze not only combinatorial but also analytical proofs. For Ramsey’s theorem for pairs and two colors (RT2 2) we obtain the upper bounded that the type 2 functionals provable recursive relative to RCA0 + Σ0 2IA+RT2 2 are in T1. This is the fragment of Gödel’s system T containing only type 1 recursion — roughly speaking it consists of functions of Ackermann type. With this we also obtain a uniform method for the extraction of T1bounds from proofs that use RT2 2. Moreover, this yields a new proof of the fact that WKL0 + Σ0 2IA + RT2 2 is Π0 3conservative over RCA0 + Σ0 2IA. The results are obtained in two steps: in the first step a term including Skolem functions for the above principles is extracted from a given proof. This is done using Gödel’s functional interpretation. After this the term is normalized, such that only specific instances of the Skolem functions are used. In the second step this term is interpreted using Π0 1comprehension. The comprehension is then eliminated in favor of induction using either elimination of monotone Skolem functions (for COH) or Howard’s ordinal analysis of bar recursion (for RT2 2). 1.
A Constructive Model of Uniform Continuity
"... Abstract. We construct a continuous model of Gödel’s system T and its logic HA ω in which all functions from the Cantor space 2 N to the natural numbers are uniformly continuous. Our development is constructive, and has been carried out in intensional type theory in Agda notation, so that, in partic ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
Abstract. We construct a continuous model of Gödel’s system T and its logic HA ω in which all functions from the Cantor space 2 N to the natural numbers are uniformly continuous. Our development is constructive, and has been carried out in intensional type theory in Agda notation, so that, in particular, we can compute moduli of uniform continuity of Tdefinable functions 2 N → N. Moreover, the model has a continuous Fan functional of type (2 N → N) → N that calculates moduli of uniform continuity. We work with sheaves, and with a full subcategory of concrete sheaves that can be presented as sets with structure, which can be regarded as spaces, and whose natural transformations can be regarded as continuous maps.
Additional services for Mathematical Structures in
, 2009
"... How to cite this article: ..."
(Show Context)
Domain representations of spaces of compact subsets
, 2010
"... We present a method for constructing from a given domain representation of a space X with underlying domain D, a domain representation of a subspace of compact subsets of X where the underlying domain is the Plotkin powerdomain of D. We show that this operation is functorial over a category of domai ..."
Abstract
 Add to MetaCart
We present a method for constructing from a given domain representation of a space X with underlying domain D, a domain representation of a subspace of compact subsets of X where the underlying domain is the Plotkin powerdomain of D. We show that this operation is functorial over a category of domain representations with a natural choice of morphisms. We study the topological properties of the space of representable compact sets and isolate conditions under which all compact subsets of X are representable. Special attention is paid to admissible representations and representations of metric spaces.
unknown title
"... On the expressive power of existential quantification in polynomialtime computability (Extended abstract) ..."
Abstract
 Add to MetaCart
(Show Context)
On the expressive power of existential quantification in polynomialtime computability (Extended abstract)
12345efghi UNIVERSITY OF WALES SWANSEA REPORT SERIES
"... Computability on topological spaces via domain representations by V StoltenbergHansen and J V Tucker Report # CSR 22007Computability on topological spaces via domain representations ..."
Abstract
 Add to MetaCart
(Show Context)
Computability on topological spaces via domain representations by V StoltenbergHansen and J V Tucker Report # CSR 22007Computability on topological spaces via domain representations
On the Expressive Power of Existential Quantification in PolynomialTime Computability
"... this paper to study the expressive power of bounded existential quantification in polynomialtime computability. Our goal was to characterize nondeterministic polynomialtime computations in a machineindependent way. The following considerations are intended to make our idea clear. Let # be the fin ..."
Abstract
 Add to MetaCart
this paper to study the expressive power of bounded existential quantification in polynomialtime computability. Our goal was to characterize nondeterministic polynomialtime computations in a machineindependent way. The following considerations are intended to make our idea clear. Let # be the finite alphabet