Weakly semirecursive sets and r.e. orderings (Q1210140): Difference between revisions

This paper continues the investigation of weakly semirecursive sets -- introduced by \textit{C. G. Jockush jun.} and \textit{J. C. Owings} [J. Symb. Logic 55, 637-644 (1990; Zbl 0702.03020)] -- using methods from the theory of r.e. partial orderings. For instance, they prove that a set is weakly semirecursive if only if it is an initial segment of an r.e. partial ordering (this result generalizes the Appel-McLaughlin Theorem for semirecursive sets).