Functionals defined by recursion

Notre Dame Journal of Formal Logic 8 (3):161-174 (1967)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 102,323

External links

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

Through your library

Analytics

Added to PP
2010-08-24

Downloads
23 (#963,599)

6 months
15 (#203,713)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Ordinal analysis of terms of finite type.W. A. Howard - 1980 - Journal of Symbolic Logic 45 (3):493-504.
An upper bound for reduction sequences in the typed λ-calculus.Helmut Schwichtenberg - 1991 - Archive for Mathematical Logic 30 (5-6):405-408.
A sequent calculus for type assignment.Jonathan P. Seldin - 1977 - Journal of Symbolic Logic 42 (1):11-28.
An abstract church-Rosser theorem. II: Applications.R. Hindley - 1974 - Journal of Symbolic Logic 39 (1):1-21.
Constructive set theoretic models of typed combinatory logic.Andreas Knobel - 1993 - Journal of Symbolic Logic 58 (1):99-118.

View all 9 citations / Add more citations

References found in this work

No references found.

Add more references