Permutations and Presentations
From MaRDI portal
Publication:4318359
DOI10.2307/2161195zbMath0817.03021MaRDI QIDQ4318359
Peter A. Cholak, Rodney G. Downey
Publication date: 27 July 1995
Full work available at URL: https://doi.org/10.2307/2161195
presentation; automorphism group; permutation; degrees of unsolvability; lattice of r.e. sets modulo the finite sets
03D25: Recursively (computably) enumerable sets and degrees
03D30: Other degrees and reducibilities in computability and recursion theory
Cites Work
- Automorphisms of the lattice of recursively enumerable sets. I: Maximal sets
- Recursively enumerable generic sets
- 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
- Recursively enumerable sets of positive integers and their decision problems
- Unnamed Item