Permutations and Presentations

DOI10.2307/2161195zbMath0817.03021OpenAlexW4210635191MaRDI QIDQ4318359

Peter A. Cholak, Rodney G. Downey

Publication date: 27 July 1995

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

zbMATH Keywords

presentationautomorphism grouppermutationdegrees of unsolvabilitylattice of r.e. sets modulo the finite sets

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Cites Work

• Unnamed Item
• 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

This page was built for publication: Permutations and Presentations