Friedberg splittings of recursively enumerable sets

DOI10.1016/0168-0072(93)90092-RMaRDI QIDQ685058zbMATH OpenFDO

Authors Michael Stob, Rodney G. Downey

Publication date 22 September 1993

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

zbMATH Keywords

automorphismorbitsdegreescreative setsFriedberg splittingshalfhemisimple degreeshemipropertiespromptly simple degrees

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Recommendations

• Automorphisms of the lattice of recursively enumerable sets: Orbits
• scientific article; zbMATH DE number 4023250
• Splitting properties of r.e. sets and degrees
• The universal splitting property. II
• Subsets of hypersimple sets

Cites work

• 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?)
• Abstract dependence, recursion theory, and the lattice of recursively enumerable filters
• Automorphisms of the Lattice of Recursively Enumerable Sets: Promptly Simple Sets
• Automorphisms of the lattice of recursively enumerable sets. I: Maximal sets
• Automorphisms of the lattice of recursively enumerable sets: Orbits
• 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)
• 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

Cited in

(12)

• Orbits of computably enumerable sets: Low sets can avoid an upper cone
• scientific article; zbMATH DE number 2167508 (Why is no real title available?)
• Introduction to autoreducibility and mitoticity
• Splitting theorems in recursion theory
• Splitter Sets and $k$ -Radius Sequences
• On splits of computably enumerable sets
• 2001 Annual Meeting of the Association for Symbolic Logic. University of Pennsylvania, Philadelphia, PA, March 10-13, 2001
• The translation theorem
• Automorphisms of the lattice of recursively enumerable sets: Orbits
• Definable incompleteness and Friedberg splittings
• scientific article; zbMATH DE number 7139148 (Why is no real title available?)
• Isomorphisms of splits of computably enumerable sets

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)