Computability and λ-definability

DOI10.2307/2268280zbMath0018.19305OpenAlexW1485161910WikidataQ54196750 ScholiaQ54196750MaRDI QIDQ5768087

Alan M. Turing

Publication date: 1937

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2268280

zbMATH Keywords

Foundations, philosophy, logic

Related Items (14)

On automorphisms of arbitrary mathematical systems ⋮ Alan Turing and the Foundations of Computable Analysis ⋮ The Mathematical Work of S.C.Kleene ⋮ Pre-recursive categories ⋮ Physics of selective systems: Computation and biology ⋮ Computability and Recursion ⋮ The Impact of the Lambda Calculus in Logic and Computer Science ⋮ Alonzo church:his life, his work and some of his miracles ⋮ Non-deterministic structures of computation ⋮ ``Backward coinduction, Nash equilibrium and the rationality of escalation ⋮ An Introduction to the Lambda Calculus ⋮ A global representation of the recursive functions in the \(\lambda\)- calculus ⋮ A Natural Axiomatization of Computability and Proof of Church's Thesis ⋮ Objectively homogeneous reference classes

Cites Work

• \(\lambda\)-definability and recursiveness
• An Unsolvable Problem of Elementary Number Theory

This page was built for publication: Computability and λ-definability