Invariance of properties under automorphisms of the lattice of recursively enumerable sets
A coinfinite r.e. set A of integers is dense simple (D. A. Martin) if the principal function enumerating the complement \(\bar A\) of A in increasing order, \(p_{\bar A}\), dominates every total recursive function. The author proves that the property of an r.e. set being dense simple is not invariant under automorphism of the collection \({\mathcal E}\) of r.e. sets. This extends the result of D. A. Martin that hypersimplicity is not invariant under automorphisms of \({\mathcal E}\). The argument involves an infinite injury pinball machine construction and uses the automorphism machinery of R. I. Soare.
- scientific article; zbMATH DE number 4033723
- Property of t-retraceability and automorphisms of the lattice of recursively enumerable sets
- Automorphisms of the Lattice of Recursively Enumerable Sets: Promptly Simple Sets
- scientific article; zbMATH DE number 4116515
- Automorphisms of the lattice of recursively enumerable sets
- A class of recursively enumerable sets
- Automorphisms of the lattice of recursively enumerable sets: Orbits
- Splitting theorems in recursion theory
- Some properties of invariant sets
- Variations on promptly simple sets
- scientific article; zbMATH DE number 4114607 (Why is no real title available?)
- scientific article; zbMATH DE number 4116515 (Why is no real title available?)
- scientific article; zbMATH DE number 4116516 (Why is no real title available?)
- The intervals of the lattice of recursively enumerable sets determined by major subsets
- Property of t-retraceability and automorphisms of the lattice of recursively enumerable sets
This page was built for publication: Invariance of properties under automorphisms of the lattice of recursively enumerable sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q790103)
