Weakly semirecursive sets and r.e. orderings (Q1210140)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 169666
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Weakly semirecursive sets and r.e. orderings |
scientific article; zbMATH DE number 169666 |
Statements
Weakly semirecursive sets and r.e. orderings (English)
0 references
16 May 1993
0 references
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).
0 references
weakly semirecursive sets
0 references
r.e. partial orderings
0 references
initial segment
0 references
0.8432711362838745
0 references
0.7334221005439758
0 references
0.7324208617210388
0 references
0.7301498651504517
0 references
