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

Abstract This article has no associated abstract. (fix it)
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1305/ndjfl/1093956080
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 62,618
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

An Upper Bound for Reduction Sequences in the Typed Λ-Calculus.Helmut Schwichtenberg - 1991 - Archive for Mathematical Logic 30 (5-6):405-408.
Ordinal Analysis of Terms of Finite Type.W. A. Howard - 1980 - Journal of Symbolic Logic 45 (3):493-504.
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.

View all 9 citations / Add more citations

Similar books and articles

Functionals Defined by Transfinite Recursion.W. W. Tait - 1965 - Journal of Symbolic Logic 30 (2):155-174.
Monotone Majorizable Functionals.Helmut Schwichtenberg - 1999 - Studia Logica 62 (2):283-289.
Axiomatic Recursion Theory and the Continuous Functionals.Simon Thompson - 1985 - Journal of Symbolic Logic 50 (2):442-450.
Functional Interpretation and Inductive Definitions.Jeremy Avigad & Henry Towsner - 2009 - Journal of Symbolic Logic 74 (4):1100-1120.
What is Radical Recursion?Steven M. Rosen - 2004 - SEED Journal 4 (1):38-57.

Analytics

Added to PP index
2010-08-24

Total views
2 ( #1,405,891 of 2,446,658 )

Recent downloads (6 months)
1 ( #456,908 of 2,446,658 )

How can I increase my downloads?

Downloads

My notes