Paul R. Young. A note on pseudo-creative sets and cylinders. Pacific journal of mathematics, vol. 14 , pp. 749–753. - Paul R. Young. On semi-cylinders, splinters, and bounded truth-table reducibility. Transactions of the American Mathematical Society, vol. 115 , pp. 329–339. - Paul R. Young. On pseudo-creative sets, splinters, and bounded-truth-table reducibility. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 13 , pp. 25–31 [Book Review]

Journal of Symbolic Logic 35 (2):335-335 (1970)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

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

Similar books and articles

A Note on Pseudo-Creative Sets and Cylinders.Paul R. Young - 1970 - Journal of Symbolic Logic 35 (2):335-335.
Arithmetical Measure.Sebastiaan A. Terwijn & Leen Torenvliet - 1998 - Mathematical Logic Quarterly 44 (2):277-286.
On the structures inside truth-table degrees.Frank Stephan - 2001 - Journal of Symbolic Logic 66 (2):731-770.
Some results on bounded truth-table degrees.Angel V. Ditchev - 1990 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 36 (3):263-271.
An incomplete set of shortest descriptions.Frank Stephan & Jason Teutsch - 2012 - Journal of Symbolic Logic 77 (1):291-307.
Enumeration Reducibility Using Bounded Information: Counting Minimal Covers.S. Barry Cooper - 1987 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 33 (6):537-560.
The computable Lipschitz degrees of computably enumerable sets are not dense.Adam R. Day - 2010 - Annals of Pure and Applied Logic 161 (12):1588-1602.
Bounded enumeration reducibility and its degree structure.Daniele Marsibilio & Andrea Sorbi - 2012 - Archive for Mathematical Logic 51 (1-2):163-186.
Reducibility and Completeness for Sets of Integers.Richard M. Friedberg & Hartley Rogers - 1959 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 5 (7-13):117-125.
On Constructively Non-Morphisms of Enumerated Sets and Constructive Non-Reducibility of Enumerations.Andrzej Orlicki - 1987 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 33 (6):485-496.

Analytics

Added to PP
2016-06-30

Downloads
7 (#1,316,802)

6 months
2 (#1,157,335)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Donald A. Martin
University of California, Los Angeles

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references