Computability and $lambda$-Definability

Journal of Symbolic Logic 2 (4):153-163 (1937)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2268280

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,219

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

A. M. Turing. Computability and λ-definability. The journal of symbolic logic, Bd. 2 , S. 153–163. [REVIEW]Rózsa Péter - 1938 - Journal of Symbolic Logic 3 (2):89-89.
Computability and λ-definability.A. M. Turing - 1937 - Journal of Symbolic Logic 2 (4):153-163.
Lambda Calculi: A Guide for the Perplexed.Chris Hankin - 1994 - Oxford University Press.
Intrinsically Hyperarithmetical Sets.Ivan N. Soskov - 1996 - Mathematical Logic Quarterly 42 (1):469-480.
Suggestion for Einstein-Podolsky-Rosen experiments using reactions likee^ + e^ - to Lambda bar Lambda to pi ^ - ppi ^ + bar p.Nils A. Törnqvist - 1981 - Foundations of Physics 11 (1-2):171-177.
A Gitik iteration with nearly Easton factoring.William J. Mitchell - 2003 - Journal of Symbolic Logic 68 (2):481-502.
Decomposable Ultrafilters and Possible Cofinalities.Paolo Lipparini - 2008 - Notre Dame Journal of Formal Logic 49 (3):307-312.
On the $\kappa$ -cub game on $\lambda $ and $I[\lambda ]$.Taneli Huuskonen, Tapani Hyttinen & Mika Rautila - 1999 - Archive for Mathematical Logic 38 (8):549-557.
Turing-, human- and physical computability: An unasked question. [REVIEW]Eli Dresner - 2008 - Minds and Machines 18 (3):349-355.
Review: S. C. Kleene, $lambda$-Definability and Recursiveness. [REVIEW]Rózsa Péter - 1937 - Journal of Symbolic Logic 2 (1):38-39.
Abstract computability and invariant definability.Yiannis N. Moschovakis - 1969 - Journal of Symbolic Logic 34 (4):605-633.
Representation theorems for transfinite computability and definability.Dag Normann - 2002 - Archive for Mathematical Logic 41 (8):721-741.
Definability, automorphisms, and dynamic properties of computably enumerable sets.Leo Harrington & Robert I. Soare - 1996 - Bulletin of Symbolic Logic 2 (2):199-213.
Review: Yuri L. Ershov, Definability and Computability. [REVIEW]Ivan Soskov - 1998 - Journal of Symbolic Logic 63 (2):747-748.

Analytics

Added to PP
2013-11-22

Downloads
60 (#257,746)

6 months
5 (#544,079)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Is the church-Turing thesis true?Carol E. Cleland - 1993 - Minds and Machines 3 (3):283-312.
On the person-based predictive policing of AI.Tzu-Wei Hung & Chun-Ping Yen - 2020 - Ethics and Information Technology 23 (3):165-176.

View all 12 citations / Add more citations

References found in this work

No references found.

Add more references