Demuth, Oswald A notion of semigenericity. (English) Zbl 0645.03040 Commentat. Math. Univ. Carol. 28, 71-84 (1987). Author’s abstract: “The class of semigeneric sets, i.e. nonrecursive sets covered by any recursively enumerable set of strings that covers all recursive sets, is studied. Besides, a new characterization of weak 1- genericity is given.” Reviewer: R.Sh.Omanadze (Tbilisi) Cited in 3 Documents MSC: 03D25 Recursively (computably) enumerable sets and degrees 03D30 Other degrees and reducibilities in computability and recursion theory Keywords:tt-reducibility; T-reducibility; minimal degrees; semigeneric sets; recursive sets; weak 1-genericity PDF BibTeX XML Cite \textit{O. Demuth}, Commentat. Math. Univ. Carol. 28, 71--84 (1987; Zbl 0645.03040) Full Text: EuDML