Computability, enumerability, unsolvability, Directions in recursion theory, edited by S. B. Cooper, T. A. Slaman, and S. S. Wainer, London Mathematical Society lecture note series, no. 224, Cambridge University Press, Cambridge, New York, and Oakleigh, Victoria, 1996, vii + 347 pp. - Leo Harrington and Robert I. Soare, Dynamic properties of computably enumerable sets, Pp. 105–121. - Eberhard Herrmann, On the ∀∃-theory of the factor lattice by the major subset relation, Pp. 139–166. - Manuel Lerman, Embeddings into the recursively enumerable degrees, Pp. 185–204. - Xiaoding Yi, Extension of embeddings on the recursively enumerable degrees modulo the cappable degrees, Pp. 313–331. - André Nies, Relativization of structures arising from computability theory. Pp. 219–232. - Klaus Ambos-Spies, Resource-bounded genericity. Pp. 1–59. - Rod Downey, Carl G. Jockusch, and Michael Stob. Array nonrecursive degrees and genericity, Pp. 93–104. - Masahiro Kumabe, Degrees of generic sets, Pp. 167–183

C. T. Chong

Download from

dx.doi.org

More download options

Computability, enumerability, unsolvability, Directions in recursion theory, edited by S. B. Cooper, T. A. Slaman, and S. S. Wainer, London Mathematical Society lecture note series, no. 224, Cambridge University Press, Cambridge, New York, and Oakleigh, Victoria, 1996, vii + 347 pp. - Leo Harrington and Robert I. Soare, Dynamic properties of computably enumerable sets, Pp. 105–121. - Eberhard Herrmann, On the ∀∃-theory of the factor lattice by the major subset relation, Pp. 139–166. - Manuel Lerman, Embeddings into the recursively enumerable degrees, Pp. 185–204. - Xiaoding Yi, Extension of embeddings on the recursively enumerable degrees modulo the cappable degrees, Pp. 313–331. - André Nies, Relativization of structures arising from computability theory. Pp. 219–232. - Klaus Ambos-Spies, Resource-bounded genericity. Pp. 1–59. - Rod Downey, Carl G. Jockusch, and Michael Stob. Array nonrecursive degrees and genericity, Pp. 93–104. - Masahiro Kumabe, Degrees of generic sets, Pp. 167–183 [Book Review]

C. T. Chong

Journal of Symbolic Logic 64 (3):1362-1365 (1999)

@article{Chong1999-CHOCEU-4,
	author = {C. T. Chong},
	doi = {10.2307/2586637},
	journal = {Journal of Symbolic Logic},
	number = {3},
	pages = {1362--1365},
	title = {Computability, Enumerability, Unsolvability, Directions in Recursion Theory, Edited by S. B. Cooper, T. A. Slaman, and S. S. Wainer, London Mathematical Society Lecture Note Series, No. 224, Cambridge University Press, Cambridge, New York, and Oakleigh, Victoria, 1996, Vii + 347 Pp. - Leo Harrington and Robert I. Soare, Dynamic Properties of Computably Enumerable Sets, Pp. 105?121. - Eberhard Herrmann, on the $\forall$$\exists$-Theory of the Factor Lattice by the Major Subset Relation, Pp. 139?166. - Manuel Lerman, Embeddings Into the Recursively Enumerable Degrees, Pp. 185?204. - Xiaoding Yi, Extension of Embeddings on the Recursively Enumerable Degrees Modulo the Cappable Degrees, Pp. 313?331. - Andr\'e Nies, Relativization of Structures Arising From Computability Theory. Pp. 219?232. - Klaus Ambos-Spies, Resource-Bounded Genericity. Pp. 1?59. - Rod Downey, Carl G. Jockusch, and Michael Stob. Array Nonrecursive Degrees and Genericity, Pp. 93?104. - Masahiro Kumabe, Degrees of Generic Sets, Pp. 167?183},
	volume = {64},
	year = {1999}
}

Chong, C. T. (1999). Computability, enumerability, unsolvability, Directions in recursion theory, edited by S. B. Cooper, T. A. Slaman, and S. S. Wainer, London Mathematical Society lecture note series, no. 224, Cambridge University Press, Cambridge, New York, and Oakleigh, Victoria, 1996, vii + 347 pp. - Leo Harrington and Robert I. Soare, Dynamic properties of computably enumerable sets, Pp. 105–121. - Eberhard Herrmann, On the ∀∃-theory of the factor lattice by the major subset relation, Pp. 139–166. - Manuel Lerman, Embeddings into the recursively enumerable degrees, Pp. 185–204. - Xiaoding Yi, Extension of embeddings on the recursively enumerable degrees modulo the cappable degrees, Pp. 313–331. - André Nies, Relativization of structures arising from computability theory. Pp. 219–232. - Klaus Ambos-Spies, Resource-bounded genericity. Pp. 1–59. - Rod Downey, Carl G. Jockusch, and Michael Stob. Array nonrecursive degrees and genericity, Pp. 93–104. - Masahiro Kumabe, Degrees of generic sets, Pp. 167–183. Journal of Symbolic Logic 64 (3):1362-1365.

Copy BIBT_EX

Abstract

This article has no associated abstract. (fix it)

Cite

Plain text

BibTeX

Formatted text

Zotero

EndNote

Reference Manager

RefWorks

Options

Mark as duplicate

Find it on Scholar

Request removal from index

Revision history

Edit

Keywords

Add keywords

Reprint years

DOI

10.2307/2586637

My notes

Analytics

Added to PP
2014-03-28

Downloads
56 (#274,303)

6 months
3 (#902,269)

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

Applied ethics	Epistemology	History of Western Philosophy	Meta-ethics	Metaphysics	Normative ethics
Philosophy of biology	Philosophy of language	Philosophy of mind	Philosophy of religion	Science Logic and Mathematics	More ...

Abstract

Categories

Keywords

Reprint years

DOI

Links

PhilArchive

External links

Through your library

My notes

Similar books and articles

Analytics

Citations of this work

References found in this work