You are not currently logged in.
Access JSTOR through your library or other institution:
If You Use a Screen ReaderThis content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Recursion Theory and the Lambda-Calculus
Robert E. Byerly
The Journal of Symbolic Logic
Vol. 47, No. 1 (Mar., 1982), pp. 67-83
Published by: Association for Symbolic Logic
Stable URL: http://www.jstor.org/stable/2273382
Page Count: 17
You can always find the topics here!Topics: Lambda calculus, Recursive functions, Automorphisms, Isomorphism, Extensionality, Recursion theory, Logical theorems, Equivalence relation, Mathematical theorems, Mathematical functions
Were these topics helpful?See something inaccurate? Let us know!
Select the topics that are inaccurate.
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Preview not available
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 godel numbers for partial recursive functions in two standard ω-URS's1 which both act like the same closed lambda-term, then there is an isomorphism of the two ω-URS's which carries e1 to e2.
The Journal of Symbolic Logic © 1982 Association for Symbolic Logic