Relative Recursive Enumerability of Generic Degrees

Journal of Symbolic Logic 56 (3):1075-1084 (1991)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2275074

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,642

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

Relative recursive enumerability of generic degrees.Masahiro Kumabe - 1991 - Journal of Symbolic Logic 56 (3):1075-1084.
Relative enumerability and 1-genericity.Wei Wang - 2011 - Journal of Symbolic Logic 76 (3):897 - 913.
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. [REVIEW]C. T. Chong - 1999 - Journal of Symbolic Logic 64 (3):1362-1365.
Recursive Enumerability and the Jump Operator.Gerald E. Sacks - 1964 - Journal of Symbolic Logic 29 (4):204-204.
Relative enumerability in the difference hierarchy.Marat M. Arslanov, Geoffrey L. Laforte & Theodore A. Slaman - 1998 - Journal of Symbolic Logic 63 (2):411-420.
Relative Enumerability in the Difference Hierarchy.Marat Arslanov, Geoffrey Laforte & Theodore Slaman - 1998 - Journal of Symbolic Logic 63 (2):411-420.
A minimal pair in the generic degrees.Denis R. Hirschfeldt - 2020 - Journal of Symbolic Logic 85 (1):531-537.
Minimal degrees recursive in 1-generic degrees.C. T. Chong & R. G. Downey - 1990 - Annals of Pure and Applied Logic 48 (3):215-225.
Comparing the degrees of enumerability and the closed Medvedev degrees.Paul Shafer & Andrea Sorbi - 2019 - Archive for Mathematical Logic 58 (5-6):527-542.
Domination, forcing, array nonrecursiveness and relative recursive enumerability.Mingzhong Cai & Richard A. Shore - 2012 - Journal of Symbolic Logic 77 (1):33-48.

Analytics

Added to PP
2016-06-30

Downloads
5 (#847,061)

6 months
2 (#1,816,284)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

The Trend of Logic and Foundation of Mathematics in Japan in 1991 to 1996.Yuzuru Kakuda - 1997 - Annals of the Japan Association for Philosophy of Science 9 (2):95-110.
The Trend of Logic and Foundation of Mathematics in Japan in 1991 to 1996.Yuzuru Kakuda, Kanji Namba & Nobuyoshi Motohashi - 1997 - Annals of the Japan Association for Philosophy of Science 9 (2):95-110.

Add more citations

References found in this work

No references found.

Add more references