Skip to main content

Hyperfinite type structures

  • Dag Normann (a1), Erik Palmgren (a2) and Viggo Stoltenberg-Hansen (a3)

The notion of a hyperfinite set comes from nonstandard analysis. Such a set has the internal cardinality of a nonstandard natural number. By a transfer principle such sets share many properties of finite sets. Here we apply this notion to give a hyperfinite model of the Kleene-Kreisel continuous functionals. We also extend the method to provide a hyperfinite characterisation of certain transfinite type structures, thus, through the work of Waagbø [14], constructing a hyperfinite model for Martin-Löf type theory.

This kind of application is not new. Normann [6] gave a characterisation of the Kleene-Kreisel continuous functionals using ‘hyperfinitary’ functionals. The novelty here is that we use a constructive version of hyperfinite functionals and also generalise the method to transfinite types. Many of the results of this paper are constructive, though not the characterisation theorems themselves.

Our characterisation of the Kleene-Kreisel continuous functionals is a supplement to a number of previous characterisations of topological and recursion-theoretical nature, see [6] for a brief survey. Altogether these characterisations show that the original concept of Kleene and Kreisel forms the correct mathematical model of the idea of finitely based functions of finite types.

There is, however, no a priori reason to believe that there is a canonical way to extend the continuous functionals to cover transfinite objects of transfinite type used in, e.g., type theory. Our characterisation of Waagbø's model indicates that the model is natural, not only seen from domain theory but from a higher perspective. Normann and Waagbø (unpublished) have subsequently obtained a limit-space characterisation that further supports this view.

Hide All
[1] Chang, C. C. and Keisler, H. J., Model theory, 3rd ed., North-Holland, Amsterdam, 1990.
[2] Ershov, Yu. L., The model C of the continuous functional, Logic colloquium '76 (Gandy, R. O. and Hyland, J. M. E., editors), North-Holland, Amsterdam, 1977, pp. 455467.
[3] Jónsson, B. and Olin, P., Almost direct products and saturation, Compositio Mathematica, vol. 20 (1968), pp. 125132.
[4] Longo, G. and Moggi, E., The hereditarily partial effective functionals and recursion theory in higher types, this Journal, vol. 49 (1984), pp. 13191332.
[5] Normann, D., The continuous functionals, Handbook of computability theory (Griffor, E. R., editor), North-Holland, Amsterdam, forthcoming.
[6] Normann, D., Characterizing the continuous functionals, this Journal, vol. 48 (1983), pp. 965969.
[7] Normann, D., A hierarchy of domains with totality but without density, Computability, enumerability, unsolvability; Directions in recursion theory (Cooper, S. B. et al., editors), Cambridge University Press, Cambridge, 1996.
[8] Palmgren, E., An information system interpretation of Martin-Löf's partial type theory with universes, Information and Computation, vol. 106 (1993), pp. 2660.
[9] Palmgren, E. and Stoltenberg-Hansen, V., Domain interpretations of Martin-Löf's partial type theory, Annals of Pure and Applied Logic, vol. 48 (1990), pp. 135196.
[10] Palmgren, E. and Stoltenberg-Hansen, V., Logically presented domains, Proceedings of the 10th IEEE symposium on logic in computer science, IEEE Computer Society Press, Washington, D.C., 1995, pp. 455463.
[11] Palmgren, E. and Stoltenberg-Hansen, V., A logical presentation of the continuous functionals, this Journal, vol. 62 (1997), pp. 10211034.
[12] Palyutin, E. A., Categorical Horn classes I, Algebra and Logic, vol. 19 (1980), pp. 377400.
[13] Stoltenberg-Hansen, V., Lindström, I., and Griffor, E. R., Mathematical theory of domains, Cambridge Tracts in Theoretical Computer Science, no. 22, Cambridge University Press, Cambridge, 1994.
[14] Waagbø, G., Denotational semantics for intuitionistic type theory using a hierarchy of domains with totality, Archive for Mathematical Logic, vol. 38 (1999), pp. 1960.
Recommend this journal

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

The Journal of Symbolic Logic
  • ISSN: 0022-4812
  • EISSN: 1943-5886
  • URL: /core/journals/journal-of-symbolic-logic
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: 4 *
Loading metrics...

Abstract views

Total abstract views: 75 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 18th July 2018. This data will be updated every 24 hours.