Friedberg splittings of recursively enumerable sets
type: Item
instance of: scholarly article
title: Friedberg splittings of recursively enumerable sets
zbMATH Open document ID: 0795.03057
DOI: 10.1016/0168-0072(93)90092-R
author: Michael Stob
author: Rodney G. Downey
published in: Annals of Pure and Applied Logic
publication date: 1993-09-22T00:00:00Z
review text: The authors investigate Friedberg splittings and in particular their orbits and degrees for various classes of r.e. sets. The starting point was the following conjecture: All Friedberg splittings of (simple) sets are automorphic. The authors show that a true Friedberg splitting (\(t\)- split) is not enough to guarantee automorphism. But the authors introduce a new notion of splitting (an \(e\)-splitting) and show that \(e\)-splittings of an r.e. set are automorphic. The authors also discuss another conjecture: Do \(f\)-creative sets form an orbit? Although they have not answered this question, they do classify the degrees of \(f\)-creative sets as exactly the promptly simple ones. Furthermore, since there are \(e\)- creative sets of all promptly simple degrees, there is an orbit in \(\Aut({\mathcal E})\) realizing exactly the promptly simple degrees. At last, the authors examine some other hemiproperties. In particular, they give proofs of results that there are nonhalfhemisimple sets yet there are completely halfhemisimple degrees.
reviewed by: Lei Qian
Mathematics Subject Classification ID: 03D25
zbMATH DE Number: 416873
zbMATH Keywords: creative sets
zbMATH Keywords: Friedberg splittings
zbMATH Keywords: orbits
zbMATH Keywords: degrees
zbMATH Keywords: automorphism
zbMATH Keywords: promptly simple degrees
zbMATH Keywords: hemiproperties
zbMATH Keywords: halfhemisimple degrees
MaRDI profile type: Publication
cites work: FINITELY PRESENTED GROUP WHOSE WORD PROBLEM HAS THE SAME DEGREE AS THAT OF AN ARBITRARILY GIVEN THUE SYSTEM (AN APPLICATION OF METHODS OF BRITTON)
cites work: Automorphisms of the Lattice of Recursively Enumerable Sets: Promptly Simple Sets
cites work: Abstract dependence, recursion theory, and the lattice of recursively enumerable filters
cites work: Automorphisms of the lattice of recursively enumerable sets: Orbits
cites work: Jumps of Hemimaximal Sets
cites work: Splitting theorems in recursion theory
cites work: Effective procedures in field theory
cites work: Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
cites work: There is no fat orbit
cites work: Post's program and incomplete recursively enumerable sets.
cites work: Subgroups of finitely presented groups
cites work: Characterization of Recursively Enumerable Sets with Supersets Effectively Isomorphic to all Recursively Enumerable Sets
cites work: Splitting properties and jump classes
cites work: Q5613949
cites work: Effective content of field theory
cites work: On Group-Theoretic Decision Problems and Their Classification. (AM-68)
cites work: Q4012134
cites work: Effectively nowhere simple sets
cites work: Nowhere simple sets and the lattice of recursively enumerable sets
cites work: Automorphisms of the lattice of recursively enumerable sets. I: Maximal sets
cites work: The infinite injury priority method
cites work: Q3819052
description: scientific article; zbMATH DE number 416873