Review: J. C. E. Dekker, A Theorem on Hypersimple Sets [Book Review]

Journal of Symbolic Logic 21 (1):100-100 (1956)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2268528

Links

PhilArchive



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

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

Hypersimplicity and semicomputability in the weak truth table degrees.George Barmpalias - 2005 - Archive for Mathematical Logic 44 (8):1045-1065.
Review: J. C. E. Dekker, Good Choice Sets; J. C. E. Dekker, The Recursive Equivalence Type of a Class of Sets. [REVIEW]C. E. Bredlau - 1969 - Journal of Symbolic Logic 34 (3):518-519.
The Hypersimple-Free C.E. WTT Degrees Are Dense in the C.E. WTT Degrees.George Barmpalias & Andrew E. M. Lewis - 2006 - Notre Dame Journal of Formal Logic 47 (3):361-370.
Review: J. C. E. Dekker, Productive Sets. [REVIEW]Norman Shapiro - 1956 - Journal of Symbolic Logic 21 (1):99-100.
Cuppability of Simple and Hypersimple Sets.Martin Kummer & Marcus Schaefer - 2007 - Notre Dame Journal of Formal Logic 48 (3):349-369.
An isolic generalization of Cauchy's theorem for finite groups.J. C. E. Dekker - 1990 - Archive for Mathematical Logic 29 (4):231-236.
Ordinal inequalities, transfinite induction, and reverse mathematics.Jeffry L. Hirst - 1999 - Journal of Symbolic Logic 64 (2):769-774.
A decomposition of the Rogers semilattice of a family of d.c.e. sets.Serikzhan A. Badaev & Steffen Lempp - 2009 - Journal of Symbolic Logic 74 (2):618-640.
J. C. E. Dekker and J. Myhill. Retraceable sets. Canadian journal of mathematics, vol. 10 , pp. 357–373. [REVIEW]A. Nerode - 1962 - Journal of Symbolic Logic 27 (1):84-85.
Strong reducibility on hypersimple sets.T. G. McLaughlin - 1965 - Notre Dame Journal of Formal Logic 6 (3):229-234.
Review: J. C. E. Dekker, Two Notes on Recursively Enumerable Sets. [REVIEW]Martin Davis - 1955 - Journal of Symbolic Logic 20 (1):73-74.
Covering analytic sets by families of closed sets.Sławomir Solecki - 1994 - Journal of Symbolic Logic 59 (3):1022-1031.
The translation theorem.Peter Cholak - 1994 - Archive for Mathematical Logic 33 (2):87-108.
Review: J. C. E. Dekker, J. Myhill, Some Theorems on Classes of Recursively Enumerable Sets. [REVIEW]Martin Davis - 1962 - Journal of Symbolic Logic 27 (1):84-84.

Analytics

Added to PP
2013-11-22

Downloads
11 (#1,138,050)

6 months
1 (#1,471,551)

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