Automorphisms of the Lattice of Recursively Enumerable Sets: Promptly Simple Sets

DOI10.2307/2154183zbMATH Open0769.03024OpenAlexW4252186358MaRDI QIDQ4018916FDOQ4018916

Authors: Peter A. Cholak, Michael Stob, Rodney G. Downey 

Publication date: 16 January 1993

Full work available at URL: https://doi.org/10.2307/2154183

Recommendations

• On orbits, of prompt and low computably enumerable sets
• Automorphisms of the lattice of recursively enumerable sets
• Automorphisms of the lattice of recursively enumerable sets: Orbits
• Variations on promptly simple sets
• scientific article; zbMATH DE number 4033723

zbMATH Keywords

automorphismrecursively enumerable setpromptly simple set

Mathematics Subject Classification ID

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

Cites Work

• Automorphisms of the lattice of recursively enumerable sets. I: Maximal sets
• Title not available (Why is that?)
• Classes of Recursively Enumerable Sets and Degrees of Unsolvability
• Classical recursion theory. The theory of functions and sets of natural numbers
• Post's program and incomplete recursively enumerable sets.
• Automorphisms of the lattice of recursively enumerable sets: Orbits
• Automorphisms of the lattice of recursively enumerable sets
• Uniformly introreducible sets
• Retraceable Sets
• On the Lattice of Recursively Enumerable Sets
• Splitting properties and jump classes
• Characterization of Recursively Enumerable Sets with Supersets Effectively Isomorphic to all Recursively Enumerable Sets
• Automorphisms of the lattice of recursively enumerable sets. Part II: Low sets
• Three theorems on the degrees of recursively enumerable sets
• On the orbits of hyperhypersimple sets

Cited In (19)

• Orbits of computably enumerable sets: Low sets can avoid an upper cone
• Title not available (Why is that?)
• Friedberg splittings of recursively enumerable sets
• Automorphisms of the lattice of \(\Pi_1^0\) classes; perfect thin classes and anc degrees
• Splitting theorems in recursion theory
• The automorphism conjecture for small sets and series parallel sets
• Some recent research directions in the computably enumerable sets
• On \(n\)-tardy sets
• On orbits, of prompt and low computably enumerable sets
• Automorphisms of the lattice of recursively enumerable sets
• Definable properties of the computably enumerable sets
• Computably enumerable sets and related issues
• Title not available (Why is that?)
• Duality, non-standard elements, and dynamic properties of r.e. sets
• Invariance of properties under automorphisms of the lattice of recursively enumerable sets
• Permutations and Presentations
• Variations on promptly simple sets
• Some orbits for \({\mathcal E}\)
• Hierarchy of Computably Enumerable Degrees II

This page was built for publication: Automorphisms of the Lattice of Recursively Enumerable Sets: Promptly Simple Sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4018916)