Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-16T21:22:30.245Z Has data issue: false hasContentIssue false

Recursion theory and the lambda-calculus

Published online by Cambridge University Press:  12 March 2014

Robert E. Byerly*
Affiliation:
Ohio State University, Columbus, Ohio 43210
*
Texas Tech University, Lubbock, Texas 79409

Abstract

A semantics for the lambda-calculus due to Friedman is used to describe a large and natural class of categorical recursion-theoretic notions. It is shown that if e1 and e2 are gödel numbers for partial recursive functions in two standard ω-URS's which both act like the same closed lambda-term, then there is an isomorphism of the two ω-URS's which carries e1 to e2.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1982

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable