Friedberg splittings of recursively enumerable sets (Q685058): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / 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) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automorphisms of the Lattice of Recursively Enumerable Sets: Promptly Simple Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abstract dependence, recursion theory, and the lattice of recursively enumerable filters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automorphisms of the lattice of recursively enumerable sets: Orbits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jumps of Hemimaximal Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Splitting theorems in recursion theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective procedures in field theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: There is no fat orbit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Post's program and incomplete recursively enumerable sets. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgroups of finitely presented groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of Recursively Enumerable Sets with Supersets Effectively Isomorphic to all Recursively Enumerable Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Splitting properties and jump classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5613949 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective content of field theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Group-Theoretic Decision Problems and Their Classification. (AM-68) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4012134 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effectively nowhere simple sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nowhere simple sets and the lattice of recursively enumerable sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automorphisms of the lattice of recursively enumerable sets. I: Maximal sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The infinite injury priority method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3819052 / rank
 
Normal rank

Latest revision as of 10:28, 22 May 2024

scientific article
Language Label Description Also known as
English
Friedberg splittings of recursively enumerable sets
scientific article

    Statements

    Friedberg splittings of recursively enumerable sets (English)
    0 references
    0 references
    0 references
    22 September 1993
    0 references
    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.
    0 references
    0 references
    0 references
    creative sets
    0 references
    Friedberg splittings
    0 references
    orbits
    0 references
    degrees
    0 references
    automorphism
    0 references
    promptly simple degrees
    0 references
    hemiproperties
    0 references
    halfhemisimple degrees
    0 references
    0 references
    0 references
    0 references
    0 references