Intensional Interpretations of Functionals of Finite Type I

Journal of Symbolic Logic 40 (4):624-625 (1975)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2271837

Links

PhilArchive



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

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

Intensional interpretations of functionals of finite type I.W. W. Tait - 1967 - Journal of Symbolic Logic 32 (2):198-212.
Equivalence of bar recursors in the theory of functionals of finite type.Marc Bezem - 1988 - Archive for Mathematical Logic 27 (2):149-160.
Finite type structures within combinatory algebras.Inge Bethke - 1991 - Annals of Pure and Applied Logic 55 (2):101-123.
Strongly majorizable functionals of finite type: A model for barrecursion containing discontinuous functionals.Marc Bezem - 1985 - Journal of Symbolic Logic 50 (3):652-660.
The hereditary partial effective functionals and recursion theory in higher types.G. Longo & E. Moggi - 1984 - Journal of Symbolic Logic 49 (4):1319-1332.
Compact and majorizable functionals of finite type.Marc Bezem - 1989 - Journal of Symbolic Logic 54 (1):271-280.
Joseph Barback. An md-class of sets indexed by a regressive function. The journal of the Australian Mathematical Society, vol. 7 (1967), pp. 301–310. [REVIEW]R. O. Gandy & John N. Crossley - 1970 - Journal of Symbolic Logic 35 (1):157-157.
The sequentially realizable functionals.John Longley - 2002 - Annals of Pure and Applied Logic 117 (1-3):1-93.
Review: R. O. Gandy, John N. Crossley, Computable Functionals of Finite Type I. [REVIEW]Richard A. Platek - 1970 - Journal of Symbolic Logic 35 (1):157-158.
Functional interpretation of Aczel's constructive set theory.Wolfgang Burr - 2000 - Annals of Pure and Applied Logic 104 (1-3):31-73.
Review: S. C. Kleene, Countable Functionals; S. C. Kleene, Recursive Functionals of Higher Finite Types. [REVIEW]Donald L. Kreider - 1962 - Journal of Symbolic Logic 27 (3):359-360.
Predicative functionals and an interpretation of ⌢ID.Jeremy Avigad - 1998 - Annals of Pure and Applied Logic 92 (1):1-34.
A decidable theory of type assignment.William R. Stirton - 2013 - Archive for Mathematical Logic 52 (5-6):631-658.
Review: S. C. Kleene, Ernest Nagel, Patrick Suppes, Alfred Tarski, Turing-Machine Computable Functionals of Finite Types I; S. C. Kleene, Turing-Machine Computable Functionals of Finite Types II. [REVIEW]D. A. Clarke - 1970 - Journal of Symbolic Logic 35 (4):588-589.
On the proof theory of type two functionals based on primitive recursive operations.David Steiner & Thomas Strahm - 2006 - Mathematical Logic Quarterly 52 (3):237-252.

Analytics

Added to PP
2017-02-21

Downloads
23 (#666,649)

6 months
8 (#347,798)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Necessity of Thought.Cesare Cozzo - 2015 - In Heinrich Wansing (ed.), Dag Prawitz on Proofs and Meaning. Springer. pp. 101-20.
Godel's interpretation of intuitionism.William Tait - 2006 - Philosophia Mathematica 14 (2):208-228.
Combinatory logic.Katalin Bimbó - 2009 - Stanford Encyclopedia of Philosophy.

View all 14 citations / Add more citations

References found in this work

No references found.

Add more references