Effective embeddings into strong degree structures
Copyright policy )Effective embeddings into strong degree structures
AbstractWe show that any partial order with a Σ3 enumeration can be effectively embedded into any partial order obtained by imposing a strong reducibility such as ≤tt on the c. e. sets. As a consequence, we obtain that the partial orders that result from imposing a strong reducibility on the sets in a level of the Ershov hiearchy below ω + 1 are co‐embeddable.
- University of Dallas United States
Recursively (computably) enumerable sets and degrees, computability theory, Computable structure theory, computable model theory, Other degrees and reducibilities in computability and recursion theory, Ershov hierarchy, strong reducibilities
Recursively (computably) enumerable sets and degrees, computability theory, Computable structure theory, computable model theory, Other degrees and reducibilities in computability and recursion theory, Ershov hierarchy, strong reducibilities
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).0 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!