Interpretation of analysis by means of constructive functionals of finite types

In A. Heyting (ed.), Constructivity in Mathematics. Amsterdam: North-Holland Pub. Co.. pp. 101--128 (1959)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Links

PhilArchive



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

External links

  • This entry has no external links. Add one.
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

Review: Georg Kreisel, Godel's Intepretation of Heyting's Arithmetic; G. Kreisel, Relations Between Classes of Constructive Functionals; Georg Kreisel, A. Heyting, Interpretation of Analysis by Means of Constructive Functionals of Finite Types. [REVIEW]D. van Dalen - 1971 - Journal of Symbolic Logic 36 (1):169-171.
Functional interpretations of constructive set theory in all finite types.Justus Diller - 2008 - Dialectica 62 (2):149–177.
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.
Unimonotone functions of finite types (recursive functionals and quantifiers of finite types revisited IV).S. C. Kleene - 1985 - In Anil Nerode & Richard A. Shore (eds.), Recursion Theory. American Mathematical Society. pp. 42--119.
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.
On the connection between Nonstandard Analysis and Constructive Analysis.Sam Sanders - forthcoming - Logique Et Analyse.
Equivalence of bar recursors in the theory of functionals of finite type.Marc Bezem - 1988 - Archive for Mathematical Logic 27 (2):149-160.
Review: S. C. Kleene, Recursive Functionals and Quantifiers of Finite Types I. [REVIEW]A. Nerode - 1962 - Journal of Symbolic Logic 27 (1):82-83.
Review: S. C. Kleene, Recursive Functionals and Quantifiers of Finite Types II. [REVIEW]Thomas J. Grilliot - 1971 - Journal of Symbolic Logic 36 (1):146-146.
Review: S. C. Kleene, Lambda-Definable Functionals of Finite Types. [REVIEW]J. Barkley Rosser - 1964 - Journal of Symbolic Logic 29 (2):104-105.
The hereditary partial effective functionals and recursion theory in higher types.G. Longo & E. Moggi - 1984 - Journal of Symbolic Logic 49 (4):1319-1332.
Syntactic calculus with dependent types.Aarne Ranta - 1998 - Journal of Logic, Language and Information 7 (4):413-431.
An interpretation of martin‐löf's constructive theory of types in elementary topos theory.Anne Preller - 1992 - Mathematical Logic Quarterly 38 (1):213-240.
A note on Spector's quantifier-free rule of extensionality.Ulrich Kohlenbach - 2001 - Archive for Mathematical Logic 40 (2):89-92.

Analytics

Added to PP
2014-01-26

Downloads
2 (#1,787,337)

6 months
1 (#1,516,429)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

A survey of proof theory.G. Kreisel - 1968 - Journal of Symbolic Logic 33 (3):321-388.
Intensional interpretations of functionals of finite type I.W. W. Tait - 1967 - Journal of Symbolic Logic 32 (2):198-212.
On weak completeness of intuitionistic predicate logic.G. Kreisel - 1962 - Journal of Symbolic Logic 27 (2):139-158.
On n-quantifier induction.Charles Parsons - 1972 - Journal of Symbolic Logic 37 (3):466-482.
Total sets and objects in domain theory.Ulrich Berger - 1993 - Annals of Pure and Applied Logic 60 (2):91-117.

View all 51 citations / Add more citations

References found in this work

No references found.

Add more references