Friedberg splittings of recursively enumerable sets

DOI10.1016/0168-0072(93)90092-RzbMath0795.03057MaRDI QIDQ685058

Rodney G. Downey, Michael Stob

Publication date: 22 September 1993

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

zbMATH Keywords

automorphism; orbits; degrees; creative sets; Friedberg splittings; halfhemisimple degrees; hemiproperties; promptly simple degrees

Mathematics Subject Classification ID

03D25: Recursively (computably) enumerable sets and degrees

Related Items

Isomorphisms of splits of computably enumerable sets, 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, Introduction to Autoreducibility and Mitoticity, Definable incompleteness and Friedberg splittings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Splitting properties and jump classes
• Automorphisms of the lattice of recursively enumerable sets: Orbits
• Splitting theorems in recursion theory
• There is no fat orbit
• Automorphisms of the lattice of recursively enumerable sets. I: Maximal sets
• Effective procedures in field theory
• Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
• Subgroups of finitely presented groups
• Characterization of Recursively Enumerable Sets with Supersets Effectively Isomorphic to all Recursively Enumerable Sets
• Effectively nowhere simple sets
• Effective content of field theory
• Jumps of Hemimaximal Sets
• Automorphisms of the Lattice of Recursively Enumerable Sets: Promptly Simple Sets
• Post's program and incomplete recursively enumerable sets.
• The infinite injury priority method
• Nowhere simple sets and the lattice of recursively enumerable sets
• On Group-Theoretic Decision Problems and Their Classification. (AM-68)
• Abstract dependence, recursion theory, and the lattice of recursively enumerable filters
• FINITELY PRESENTED GROUP WHOSE WORD PROBLEM HAS THE SAME DEGREE AS THAT OF AN ARBITRARILY GIVEN THUE SYSTEM (AN APPLICATION OF METHODS OF BRITTON)