Book contents
- Frontmatter
- Contents
- Preface
- Participants Photograph
- Generic absoluteness for Σ1 formulas and the continuum problem
- Axioms of generic absoluteness
- Generalised dynamic ordinals — universal measures for implicit computational complexity
- The Worm principle
- “One is a lonely number”: logic and communication
- Computable versions of the uniform boundedness theorem
- Symmetry of the universal computable function: A study of its automorphisms, homomorphisms and isomorphic embeddings
- PCF theory and Woodin cardinals
- Embedding finite lattices into the computably enumerable degrees — a status survey
- Dimension theory inside a homogeneous model
- Reals which compute little
- Bisimulation invariance and finite models
- Choice principles in constructive and classical set theories
- Ash's theorem for abstract structures
- Martin-Löf random and PA-complete sets
- Learning and computing in the limit
- References
Computable versions of the uniform boundedness theorem
Published online by Cambridge University Press: 31 March 2017
Book contents
- Frontmatter
- Contents
- Preface
- Participants Photograph
- Generic absoluteness for Σ1 formulas and the continuum problem
- Axioms of generic absoluteness
- Generalised dynamic ordinals — universal measures for implicit computational complexity
- The Worm principle
- “One is a lonely number”: logic and communication
- Computable versions of the uniform boundedness theorem
- Symmetry of the universal computable function: A study of its automorphisms, homomorphisms and isomorphic embeddings
- PCF theory and Woodin cardinals
- Embedding finite lattices into the computably enumerable degrees — a status survey
- Dimension theory inside a homogeneous model
- Reals which compute little
- Bisimulation invariance and finite models
- Choice principles in constructive and classical set theories
- Ash's theorem for abstract structures
- Martin-Löf random and PA-complete sets
- Learning and computing in the limit
- References
- Type
- Chapter
- Information
- Logic Colloquium '02 , pp. 130 - 151Publisher: Cambridge University PressPrint publication year: 2006
References
[1] , Sur les opérations dans les ensembles abstraits et leur application aux equations integrales Fundamenta Mathematicae, vol. 3 (1922), pp. 133–181.
[2] and , Sur les fonctions calculables Annales de la Société Polonaise de Mathématique, vol. 16 (1937), p. 223.
[3] and , Sur le principe de la condensation des singularités Fundamenta Mathematicae, vol. 9 (1927), pp. 50–61.
[4] and , Constructive Analysis, Grundlehren der Mathematischen Wissenschaften, vol. 279, Springer-Verlag, Berlin, 1985.
[5] , Computability and Complexity in Analysis, Informatik Berichte, vol. 286, Fern Universität Hagen, Fachbereich Informatik, Hagen, 2001.
[6] , Computable versions of Baire's category theorem Mathematical Foundations of Computer Science, 2001 (Mariánské Lázně) (Jiří Sgall, Aleš Pultr, and Petr Kolman, editors), Lecture Notes in Computer Science, vol. 2136, Springer, Berlin, 2001, pp. 224–235.
[7] , Computing uniform bounds CCA 2002 Computability and Complexity in Analysis (Vasco Brattka, Matthias Schröder, and , editors), Electronic Notes in Theoretical Computer Science, vol. 66, Elsevier, Amsterdam, 2002, 5th InternationalWorkshop, CCA 2002, Málaga, Spain, July 12–13, 2002.
[8] , Computability over topological structures Computability and Models (S. and , editors), Kluwer/Plenum, New York, 2003, pp. 93–136.
[9] , Computability on non-separable Banach spaces and Landau's theorem From Sets and Types to Topology and Analysis: Towards Practicable Foundations for Constructive Mathematics (Laura Crosilla and , editors), Oxford University Press, 2005, pp. 316–333.
[10] and , Computability on subsets of metric spaces Theoretical Computer Science, vol. 305 (2003), no. 1-3, pp. 43–76.
[11] and , Computing with sequences, weak topologies and the axiom of choice Computer Science Logic (Luke Ong, editor), Lecture Notes in Computer Science, vol. 3634, Springer, 2005, pp. 462–476.
[12] and , Computability on subsets of Euclidean space. I. Closed and compact subsets Theoretical Computer Science, vol. 219 (1999), no. 1-2, pp. 65–93.
[13] and , The Baire category theorem in weak subsystems of second-order arithmetic The Journal of Symbolic Logic, vol. 58 (1993), no. 2, pp. 557–578.
[14] and , First Course in Functional Analysis, Prentice-Hall Inc., Englewood Cliffs, N.J., 1965.
[15] , Onthe definitions of computable real continuous functions Polska Akademia Nauk. Fundamenta Mathematicae, vol. 44 (1957), pp. 61–71.
[16] , Sequential continuity of linear mappings in constructive mathematics The Journal of Universal Computer Science, vol. 3 (1997), no. 11, pp. 1250–1254.
[17] , Sequentially continuity in constructive mathematics Combinatorics, computability and logic (Constant，a, 2001) (C. S. Calude,M. J. Dinneen, and S. Sburlan, editors), Springer Ser. Discrete Math. Theor. Comput. Sci., Springer, London, 2001, pp. 5–12.
[18] Ker-IKo, Complexity Theory of Real Functions, Progress in Theoretical Computer Science, Birkhäuser, Boston, MA, 1991.
[19] , Lectures on Constructive Mathematical Analysis, Translations of Mathematical Monographs, vol. 60, American Mathematical Society, Providence, RI, 1984.Google Scholar
[20] , Extension de la notion de fonction récursive aux fonctions d'une ou plusieurs variables réelles. I, II, III Comptes Rendus Mathematique. Académie des Sciences. Paris, vol. 240, 241 (1955), pp. 2478–2480, 13–14, 151–153.
[21] , Quelques procédés de definition en topologie recursive Constructivity in Mathematics: Proceedings of the Colloquium Held at Amsterdam, 1957 (A. Heyting, editor), Studies in Logic and the Foundations of Mathematics, North-Holland, Amsterdam, 1959, pp. 129–158.
[22] , , and , Recursive limits on the Hahn-Banach theorem Errett Bishop: Reflections on Him and His Research (San Diego, Calif., 1983) (Murray Rosenblatt, editor), Contemporary Mathematics, vol. 39, AMS, Providence, RI, 1985, pp. 85–91.Google Scholar
[23] , Recursive metric spaces Polska Akademia Nauk. Fundamenta Mathematicae, vol. 55 (1964), pp. 215–238.
[24] and , Computability in Analysis and Physics, Perspectives in Mathematical Logic, Springer-Verlag, Berlin, 1989.
[25] , Extended admissibility Theoretical Computer Science, vol. 284 (2002), no. 2, pp. 519–538.Google Scholar
[26] , Subsystems of Second Order Arithmetic, Perspectives inMathematical Logic, Springer-Verlag, Berlin, 1999.
[27] , On effective topological spaces The Journal of Symbolic Logic, vol. 63 (1998), no. 1, pp. 185–221.
[28] , Comparing the theory of representations and constructive mathematics Computer Science Logic (Berne, 1991) (E. Börger et al., editors), Lecture Notes in Computer Science, vol. 626, Springer, Berlin, 1992, pp. 382–395.
[29] , On computable numbers, with an application to the “Entscheidungsproblem” Proceedings of the London Mathematical Society, Vol. 42, no. 2, 1936, pp. 230–265.
[30] , Computability on computable metric spaces Theoretical Computer Science, vol. 113 (1993), no. 2, pp. 191–210.
[31] , Computable Analysis, Springer-Verlag, Berlin, 2000.
[32] and , Is wave propagation computable or can wave computers beat the Turing machine? Proceedings of the London Mathematical Society. Third Series, vol. 85 (2002), no. 2, pp. 312–332.
[33] , , and , Effective properties of sets and functions in metric spaces with computability structure Theoretical Computer Science, vol. 219 (1999), no. 1-2, pp. 467–486.
[34] , Computability structure of the Sobolev spaces and its applications Theoretical Computer Science, vol. 219 (1999), no. 1-2, pp. 487–510.