Skip to main content Accesibility Help

An injection from the Baire space to natural numbers


We provide a realizability model based on infinite time Turing machines in which there is an injection from the internal Baire space, the object of infinite sequences of numbers, to the object of natural numbers.

Hide All
Bauer, A. (2000) The Realizability Approach to Computable Analysis and Topology, Ph.D. thesis, Carnegie Mellon University.
Hamkins, J. D. and Lewis, A. (2000) Infinite time turing machines. Journal of Symbolic Logic 65 (2) 567604.
Hyland, J. (1982) The effective topos. In: Troelstra, A. and Dalen, D. V. (eds.) The L.E.J. Brouwer Centenary Symposium, North Holland Publishing Company 165216.
Oliva, P. (2011) Programs from classical proofs via Gödel's dialectica interpretation. In: 27th Conference on Mathematical Foundations of Programming Semantics (MFPS XXVII), Pittsburgh, USA.
van Oosten, J. (2008) Realizability: An Introduction to its Categorical Side, Studies in Logic and the Foundations of Mathematics volume 152, Elsevier.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Mathematical Structures in Computer Science
  • ISSN: 0960-1295
  • EISSN: 1469-8072
  • URL: /core/journals/mathematical-structures-in-computer-science
Please enter your name
Please enter a valid email address
Who would you like to send this to? *


Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed