Friedberg splittings of recursively enumerable sets
From MaRDI portal
Publication:685058
DOI10.1016/0168-0072(93)90092-RzbMath0795.03057MaRDI QIDQ685058
Michael Stob, Rodney G. Downey
Publication date: 22 September 1993
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
automorphismorbitsdegreescreative setsFriedberg splittingshalfhemisimple degreeshemipropertiespromptly simple degrees
Related Items (7)
Introduction to Autoreducibility and Mitoticity ⋮ Isomorphisms of splits of computably enumerable sets ⋮ 2001 Annual Meeting of the Association for Symbolic Logic ⋮ Orbits of computably enumerable sets: Low sets can avoid an upper cone ⋮ Splitting theorems in recursion theory ⋮ Definable incompleteness and Friedberg splittings ⋮ The translation theorem
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)
This page was built for publication: Friedberg splittings of recursively enumerable sets
