Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer-journals/the-distribution-of-the-generic-recursively-enumerable-degrees-UciB1c5Nok
References (24)
-
K. Ambos-Spies (1984)
On pairs of recursively enumerable degreesTransactions of the American Mathematical Society, 283
-
M. Ingrassia (1981)
P-Genericity for Recursively Enumerable Sets -
H. Ebbinghaus, G. Müller, G. Sacks (1985)
Recursion Theory Week -
R. Soare (1987)
Recursively enumerable sets and degreesBulletin of the American Mathematical Society, 84
-
T. Slaman (1991)
The Density of Infima in the Recursively Enumerable DegreesAnn. Pure Appl. Log., 52
-
Peter Fejer (1982)
Branching degrees above low degreesTransactions of the American Mathematical Society, 273
-
C.G. Jockusch (1980)
Recursion theory: its generalization and applications -
K. Ambos-Spies (1985)
Cupping and noncapping in the r.e. weak truth table and turing degreesArchiv für mathematische Logik und Grundlagenforschung, 25
-
K. Ambos-Spies, Peter Fejer (1988)
Degree theoretical splitting properties of recursively enumerable setsJournal of Symbolic Logic, 53
-
Peter Fejer (1983)
The density of the nonbranching degreesAnn. Pure Appl. Log., 24
-
R. Ladner (1973)
Mitotic recursively enumerable setsJournal of Symbolic Logic, 38
-
W. Maass (1982)
Recursively enumerable generic setsJournal of Symbolic Logic, 47
-
Jr. Rogers (1969)
Theory of Recursive Functions and Effective Computability -
R.M. Friedberg (1957)
Two recursively enumerable sets of incomparable degrees of unsolvabilityProc. Natl. Acad. Sci. USA, 43
-
R. Downey, T. Slaman (1989)
Completely Mitotic r.e. DegreesAnn. Pure Appl. Log., 41
-
Emil Post (1944)
Recursively enumerable sets of positive integers and their decision problemsBulletin of the American Mathematical Society, 50
-
K. Ambos-Spies (1985)
Generators of the recursively enumerable degrees -
C. Jockusch (1980)
Degrees of generic sets -
K. Ambos-Spies, M. Lerman (1986)
Lattice embeddings into the recursively enumerable degreesJournal of Symbolic Logic, 51
-
Carl JockuschJr. (1985)
Genericity for recursively enumerable sets -
R. Robinson (1971)
Interpolation and Embedding in the Recursively Enumerable DegreesAnnals of Mathematics, 93
-
G. Sacks (1964)
The Recursively Enumerable Degrees are DenseAnnals of Mathematics, 80
-
Richard Friedberg (1957)
TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944).Proceedings of the National Academy of Sciences of the United States of America, 43 2
-
Juichi Shinoda, T. Tugué (1991)
Preface - Papers presented at the International Symposium on Mathematical Logic and its Applications Nagoya, Japan, November 7-11, 1988Ann. Pure Appl. Log., 52
- Publisher
- Springer Journals
- Copyright
- Copyright © 1992 by Springer-Verlag
- Subject
- Mathematics; Mathematical Logic and Foundations; Mathematics, general; Algebra
- ISSN
- 0933-5846
- eISSN
- 1432-0665
- DOI
- 10.1007/BF01269953
- Publisher site
- See Article on Publisher Site
Abstract
In this paper we investigate problems about densities ofe-generic,s-generic andp-generic degrees. We, in particular, show that allp-generic degrees are non-branching, which answers an open question by Jockusch who asked: whether alls-generic degrees are non-branching and refutes a conjecture of Ingrassia; the set of degrees containing r.e.p-generic sets is the same as the set of r.e. degrees containing an r.e. non-autoreducible set.
Journal
Archive for Mathematical Logic – Springer Journals
Published: Feb 21, 2005