Density and Choice for Total Continuous Functionals (1996)

by Helmut Schwichtenberg
Venue:About and Around Georg Kreisel
Citations:8 - 3 self

Active Bibliography

TOWARDS A FORMAL THEORY OF COMPUTABILITY – Simon Huber, Basil A. Karádais, Helmut Schwichtenberg
Recursion Theory – Helmut Schwichtenberg - 2007
7 Recursion on the partial continuous functionals – Helmut Schwichtenberg - 2006
162 Constructivism and Proof Theory – A. S. Troelstra - 2003
10 Continuous Functionals of Dependent and Transfinite Types – Ulrich Berger - 1995
8 Modified Bar Recursion – Ulrich Berger, Paulo B. Oliva - 2002
12 Notions of computability at higher types I – John Longley - 2005
4 On the ubiquity of certain total type structures – John Longley - 2007
2 Applications of the Kleene-Kreisel Density Theorem to Theoretical Computer Science – Dag Normann - 2006
1 From Higher Order Terms To Circuits – Helmut Schwichtenberg, Karl Stroetmann
Domain-Theoretic Methods for Program Synthesis – Ulrich Berger
2 Minimisation Vs. Recursion on the Partial Continuous Functionals – Ulrich Berger
2 Computing with functionals - computability theory or computer science – Dag Normann - 2006
6 On sequential functionals of type 3 – Dag Normann - 2006
Domain representations of spaces of compact subsets – Ulrich Berger, Jens Blanck, Petter Kristian Køber - 2010
mlq header will be provided by the publisher Classical truth in higher types – Ulrich Berger
Additional services for Mathematical Structures in – Ulrich Berger, Jens Blanck, Petter Kristian, Køber Domain, Ulrich Berger, Jens Blanck, Petter Kristian Køber - 2009
14 Infinite sets that admit fast exhaustive search – Martín Escardó - 2007
1 Applications of inductive definitions and choice principles to program synthesis – Ulrich Berger, Monika Seisenberger