A note on many·one reducibility

Journal of Symbolic Logic 28 (1):35-42 (1963)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2271334

Other Versions

reprint Liu, Shih-Chao (1963) "A note on many·one reducibility". Journal of Symbolic Logic 28(2):143-153

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,139

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

Liu Shih-Chao. A note on many-one reducibility.Gerald E. Sacks - 1966 - Journal of Symbolic Logic 31 (3):512.
Review: Shih-Chao Liu, A Note on Many-One Reducibility. [REVIEW]Gerald E. Sacks - 1966 - Journal of Symbolic Logic 31 (3):512-512.
Review: Shih-Chao Liu, On Many-One Degrees. [REVIEW]Gerald E. Sacks - 1966 - Journal of Symbolic Logic 31 (3):512-513.
Shih-Chao Liu. On many-one degrees. The journal of symbolic logic, vol. 28 no. 2 , pp. 143–153.Gerald E. Sacks - 1966 - Journal of Symbolic Logic 31 (3):512-513.

Analytics

Added to PP
2009-01-28

Downloads
36 (#629,586)

6 months
10 (#413,587)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

Recursive well-founded orderings.Keh-Hsun Chen - 1978 - Annals of Mathematical Logic 13 (2):117-147.

Add more citations

References found in this work

Number theoretic concepts and recursive well-orderings.G. Kreisel, J. Shoenfield & Hao Wang - 1960 - Archive for Mathematical Logic 5 (1-2):42-64.

Add more references