×

zbMATH — the first resource for mathematics

A notion of semigenericity. (English) Zbl 0645.03040
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.”

MSC:
03D25 Recursively (computably) enumerable sets and degrees
03D30 Other degrees and reducibilities in computability and recursion theory
PDF BibTeX XML Cite
Full Text: EuDML