Review: S. C. Kleene, $lambda$-Definability and Recursiveness [Book Review]

Journal of Symbolic Logic 2 (1):38-39 (1937)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



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

External links

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

Through your library

Similar books and articles

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.
Computability and $lambda$-Definability.A. M. Turing - 1937 - Journal of Symbolic Logic 2 (4):153-163.
On definability in multimodal logic.Joseph Y. Halpern, Dov Samet & Ella Segev - 2009 - Review of Symbolic Logic 2 (3):451-468.
More on Regular Reduced Products.Juliette Cara Kennedy & Saharon Shelah - 2004 - Journal of Symbolic Logic 69 (4):1261 - 1266.
Stationary sets and infinitary logic.Saharon Shelah & Jouko Väänänen - 2000 - Journal of Symbolic Logic 65 (3):1311-1320.
Weakly Normal Closures of Filters on $P_kappa lambda$.Masahiro Shioya - 1993 - Journal of Symbolic Logic 58 (1):55-63.

Analytics

Added to PP
2013-11-22

Downloads
30 (#530,318)

6 months
1 (#1,462,504)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references