Friedberg splittings of recursively enumerable sets
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.
- Abstract dependence, recursion theory, and the lattice of recursively enumerable filters
- Automorphisms of the lattice of recursively enumerable sets. I: Maximal sets
- Automorphisms of the lattice of recursively enumerable sets: Orbits
- Automorphisms of the Lattice of Recursively Enumerable Sets: Promptly Simple Sets
- Characterization of Recursively Enumerable Sets with Supersets Effectively Isomorphic to all Recursively Enumerable Sets
- Effective content of field theory
- Effective procedures in field theory
- Effectively nowhere simple sets
- FINITELY PRESENTED GROUP WHOSE WORD PROBLEM HAS THE SAME DEGREE AS THAT OF AN ARBITRARILY GIVEN THUE SYSTEM (AN APPLICATION OF METHODS OF BRITTON)
- scientific article; zbMATH DE number 4091484 (Why is no real title available?)
- scientific article; zbMATH DE number 67424 (Why is no real title available?)
- scientific article; zbMATH DE number 3336816 (Why is no real title available?)
- Jumps of Hemimaximal Sets
- Nowhere simple sets and the lattice of recursively enumerable sets
- On Group-Theoretic Decision Problems and Their Classification. (AM-68)
- Post's program and incomplete recursively enumerable sets.
- Splitting properties and jump classes
- Splitting theorems in recursion theory
- Subgroups of finitely presented groups
- The infinite injury priority method
- There is no fat orbit
- Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
- Automorphisms of the lattice of recursively enumerable sets: Orbits
- Splitting theorems in recursion theory
- The translation theorem
- Orbits of computably enumerable sets: Low sets can avoid an upper cone
- 2001 Annual Meeting of the Association for Symbolic Logic. University of Pennsylvania, Philadelphia, PA, March 10-13, 2001
- On splits of computably enumerable sets
- Introduction to autoreducibility and mitoticity
- Definable incompleteness and Friedberg splittings
- Splitter Sets and k -Radius Sequences
- Isomorphisms of splits of computably enumerable sets
- scientific article; zbMATH DE number 2167508 (Why is no real title available?)
- Friedberg splittings in Σ30 quotient lattices of
- scientific article; zbMATH DE number 7139148 (Why is no real title available?)
This page was built for publication: Friedberg splittings of recursively enumerable sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685058)
