W. W. Tait. Functionals defined by transfinite recursion. The journal of symbolic logic, vol. 30 , pp. 155–174

Journal of Symbolic Logic 31 (3):509-510 (1966)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

1996

DOI

10.2307/2270490

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,752

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Functionals Defined by Transfinite Recursion.R. E. Vesley & W. W. Tait - 1966 - Journal of Symbolic Logic 31 (3):509.
Functionals defined by transfinite recursion.W. W. Tait - 1965 - Journal of Symbolic Logic 30 (2):155-174.
Recursion on the countable functionals.Dag Normann - 1980 - New York: Springer Verlag.
Functional interpretation and inductive definitions.Jeremy Avigad & Henry Towsner - 2009 - Journal of Symbolic Logic 74 (4):1100-1120.
Axiomatic recursion theory and the continuous functionals.Simon Thompson - 1985 - Journal of Symbolic Logic 50 (2):442-450.
Review: Dag Normann, Recursion on the Countable Functionals; Dag Normann, The Continuous Functionals; Computations, Recursions and Degrees. [REVIEW]Peter G. Hinman - 1984 - Journal of Symbolic Logic 49 (2):668-670.
The hereditary partial effective functionals and recursion theory in higher types.G. Longo & E. Moggi - 1984 - Journal of Symbolic Logic 49 (4):1319-1332.
Normann Dag. Recursion on the countable functionals. Lecture notes in mathematics, vol. 811. Springer-Verlag, Berlin, Heidelberg, and New York, 1980, VIII + 191 pp.Normann Dag. The continuous functionals; computations, recursions and degrees. Annals of mathematical logic, vol. 21 , pp. 1–26. [REVIEW]Peter G. Hinman - 1984 - Journal of Symbolic Logic 49 (2):668-670.
W. W. Tait. Intensional interpretations of functionals of finite type I. The journal of symbolic logic, vol. 32 , pp. 198–212. [REVIEW]J. Y. Girard - 1975 - Journal of Symbolic Logic 40 (4):624-625.
The Computational Power of ℳω.Dag Normann & Christian Rørdam - 2002 - Mathematical Logic Quarterly 48 (1):117-124.
Intensional interpretations of functionals of finite type I.W. W. Tait - 1967 - Journal of Symbolic Logic 32 (2):198-212.
Intensional Interpretations of Functionals of Finite Type I.W. W. Tait - 1975 - Journal of Symbolic Logic 40 (4):624-625.
Recursion on the Countable Functionals.Peter G. Hinman - 1984 - Journal of Symbolic Logic 49 (2):668-670.
Describing ordinals using functionals of transfinite type.Peter Aczel - 1972 - Journal of Symbolic Logic 37 (1):35-47.
A direct proof of schwichtenberg’s bar recursion closure theorem.Paulo Oliva & Silvia Steila - 2018 - Journal of Symbolic Logic 83 (1):70-83.

Analytics

Added to PP
2014-04-01

Downloads
8 (#1,313,626)

6 months
1 (#1,464,097)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references