Functionals defined by recursion

DOI10.1305/NDJFL/1093956080MaRDI QIDQ2535386zbMATH OpenOpenAlexFDO

Authors L. E. Sachis

Publication date 1967

Published in Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1305/ndjfl/1093956080

zbMATH Keywords

recursion theory, constructive mathematics

Cited in

(10)

• Typing and computational properties of lambda expressions
• An upper bound for reduction sequences in the typed \(\lambda\)-calculus
• A sequent calculus for type assignment
• Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility
• The completeness theorem for typing lambda-terms
• Reduction of higher type levels by means of an ordinal analysis of finite terms
• Constructive set theoretic models of typed combinatory logic
• An abstract Church-Rosser theorem. II: Applications
• Ordinal analysis of terms of finite type
• On a conjecture of Bergstra and Tucker

This page was built for publication: Functionals defined by recursion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2535386)