Friedberg splittings of recursively enumerable sets

DOI10.1016/0168-0072(93)90092-RzbMATH Open0795.03057MaRDI QIDQ685058FDOQ685058

Authors: Michael Stob, Rodney G. Downey 

Publication date: 22 September 1993

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

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

zbMATH Keywords

automorphismorbitsdegreescreative setsFriedberg splittingshalfhemisimple degreeshemipropertiespromptly simple degrees

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (12)

• Orbits of computably enumerable sets: Low sets can avoid an upper cone
• Title not available (Why is that?)
• 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
• Definable incompleteness and Friedberg splittings
• Automorphisms of the lattice of recursively enumerable sets: Orbits
• Title not available (Why is that?)
• 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)