Review: Shih-Chao Liu, A Theorem on General Recursive Functions [Book Review]

Journal of Symbolic Logic 29 (2):104-104 (1964)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



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

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Recursive linear orderings and hyperarithmetical functions.Shih-Chao Liu - 1962 - Notre Dame Journal of Formal Logic 3 (3):129-132.
Four types of general recursive well-orderings.Shih Chao Liu - 1962 - Notre Dame Journal of Formal Logic 3 (2):75-78.
Ramsey's Theorem for Pairs and Provably Recursive Functions.Alexander Kreuzer & Ulrich Kohlenbach - 2009 - Notre Dame Journal of Formal Logic 50 (4):427-444.
Tennenbaum's Theorem and Unary Functions.Sakae Yaegasi - 2008 - Notre Dame Journal of Formal Logic 49 (2):177-183.
On the analytic and the synthetic.Liu Shih-Chao - 1956 - Philosophical Review 65 (2):218-228.
Degrees of Relative Provability.Mingzhong Cai - 2012 - Notre Dame Journal of Formal Logic 53 (4):479-489.
Review: Shih-Chao Liu, On Many-One Degrees. [REVIEW]Gerald E. Sacks - 1966 - Journal of Symbolic Logic 31 (3):512-513.
Accessible recursive functions.Stanley S. Wainer - 1999 - Bulletin of Symbolic Logic 5 (3):367-388.

Analytics

Added to PP
2013-11-22

Downloads
1 (#1,886,728)

6 months
1 (#1,510,037)

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
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