Weakly semirecursive sets and r.e. orderings
type: Item
instance of: scholarly article
title: Weakly semirecursive sets and r.e. orderings
zbMATH Open document ID: 0767.03023
DOI: 10.1016/0168-0072(93)90040-K
author: Frank Stephan
author: Martin Kummer
published in: Annals of Pure and Applied Logic
publication date: 1993-05-16T00:00:00Z
review text: 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).
Mathematics Subject Classification ID: 03D25
Mathematics Subject Classification ID: 03D30
Mathematics Subject Classification ID: 03D35
zbMATH DE Number: 169666
zbMATH Keywords: weakly semirecursive sets
zbMATH Keywords: r.e. partial orderings
zbMATH Keywords: initial segment
reviewed by: Cristian S. Calude
MaRDI profile type: Publication
cites work: Terse, superterse, and verbose sets
cites work: Q3487329
cites work: Hypersimple sets with retraceable complements
cites work: Semirecursive Sets and Positive Reducibility
cites work: Weakly semirecursive sets
cites work: The Degrees of Hyperimmune Sets
cites work: Two-dimensional partial orderings: Recursive model theory
cites work: Classical recursion theory. Vol. II
cites work: Q3949052
cites work: R. e. presented linear orders
cites work: Linear Order Types of Nonrecursive Presentability
cites work: Effective extensions of partial orders
cites work: Q3934380
cites work: Q4040892
full work available at URL: 0168-0072(93)90040-k
OpenAlex ID: W1986438122
Wikidata QID: Q126772957
description: scientific article; zbMATH DE number 169666