Book contents
- Frontmatter
- Contents
- Introduction
- Colloquium Program
- TUTORIAL
- RESEARCH ARTICLES
- Indestructibility and strong compactness
- Some applications of regularmarkers
- Has the continuumhypothesis been settled?
- Geometry of interaction IV: the feedback equation
- On local modularity in homogeneous structures
- Descriptive set theory and uncountable model theory
- Decidable properties of logical calculi and of varieties of algebras
- Stabilization — an alternative to double-negation translation for classical natural deduction
- Definability and reducibility in higher types over the reals
- Predicativity problems in point-free topology
- Rank inequalities in the theory of differentially closed fields
- Consistency and games— in search of new combinatorial principles
- Realizability for constructive Zermelo-Fraenkel set theory
- On long EF-equivalence in non-isomorphic models
- The theory of is undecidable
- Cocovering and set forcing
- References
Definability and reducibility in higher types over the reals
from RESEARCH ARTICLES
Published online by Cambridge University Press: 30 March 2017
By
Book contents
- Frontmatter
- Contents
- Introduction
- Colloquium Program
- TUTORIAL
- RESEARCH ARTICLES
- Indestructibility and strong compactness
- Some applications of regularmarkers
- Has the continuumhypothesis been settled?
- Geometry of interaction IV: the feedback equation
- On local modularity in homogeneous structures
- Descriptive set theory and uncountable model theory
- Decidable properties of logical calculi and of varieties of algebras
- Stabilization — an alternative to double-negation translation for classical natural deduction
- Definability and reducibility in higher types over the reals
- Predicativity problems in point-free topology
- Rank inequalities in the theory of differentially closed fields
- Consistency and games— in search of new combinatorial principles
- Realizability for constructive Zermelo-Fraenkel set theory
- On long EF-equivalence in non-isomorphic models
- The theory of is undecidable
- Cocovering and set forcing
- References
- Type
- Chapter
- Information
- Logic Colloquium '03 , pp. 200 - 220Publisher: Cambridge University PressPrint publication year: 2006
References
[1] and , Domain theory, Handbook of logic in computer science (, , and , editors), vol. 3, Clarendon Press, 1994.
[2] , , and , Comparing functional paradigms for exact realnumber computation, Proceedings ICALP 2002, LNCS, vol. 2380, Springer, 2002, pp. 488–500.
[3] , Domain representability of metric spaces, Annals of Pure and Applied Logic, vol. 83 (1997), pp. 225–247.Google Scholar
[4] , PCF extended with real numbers, Theoretical Computer Science, vol. 162 (1996), no. (1), pp. 79–115.Google Scholar
[5] , , and Scott, Continuous lattices and domains, Cambridge University Press, 2003.
[6] , The theory of analytic spaces, Various Publication Series No.10, Aarhus University, 1970.
[7] , Calculabilité sur les réels, Thesis, Paris VII, 2003.
[8] , Classical descriptive set theory, Springer, New York, 1995.
[9] , Interpretation of analysis by means of functionals of finite type, Constructivity in mathematics (, editor), North-Holland, (1959), pp. 101–128.
[10] and , The hereditary partial effective functionals and recursion theory in higher types, The Journal of Symbolic Logic, vol. 49 (1984), pp. 1319–1332.Google Scholar
[11] , External and internal algorithms on the continuous functionals, Patras logic symposium (, editor), North-Holland, 1982, pp. 137–144.
[12] , The continuous functionals of finite types over the reals, Domains and processes (, , , and , editors), Kluwer Academic Publishers, 2001, pp. 103–124.
[13] , Hierarchies of total functionals over the reals, Theoretical Computer Science, vol. 316 (2004), pp. 137–151.Google Scholar
[14] , Comparing hierarchies of total functionals, in preparation.
[15] , Admissible representations of limit spaces,Computability and complexity in analysis (, , , and , editors), vol. 237, Informatik Berichte, 2000, pp. 369–388.Google Scholar
[16] , , and , Mathematical theory of domains, Cambridge Tracts in Theoretical Computer Science, vol. 22, Cambridge University Press, 1994.
[17] and , Abstract versus concrete models of computation on partial metric algebras, ACMTransactions on Computational Logic, vol. 5 (2004), pp. 611–668.Google Scholar
[18] , Computable analysis, Texts in Theoretical Computer Science, Springer Verlag, Berlin, 2000.