Automorphisms of the lattice of recursively enumerable sets

DOI10.1090/S0002-9904-1974-13350-1zbMath0281.02044MaRDI QIDQ4767305

Robert I. Soare

Publication date: 1974

Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)

Mathematics Subject Classification ID

03D25: Recursively (computably) enumerable sets and degrees

03D30: Other degrees and reducibilities in computability and recursion theory

Related Items

A hierarchy for the plus cupping Turing degrees, Definability in the local structure of the ω-Turing degrees, The Complexity of Orbits of Computably Enumerable Sets, On boolean lowness and boolean highness, There is no ordering on the classes in the generalized high/low hierarchies, Some lowness properties and computational complexity sequences, Nowhere simple sets and the lattice of recursively enumerable sets, Recursively enumerable sets and degrees, Computational complexity, speedable and levelable sets, A Reducibility Condition for Recursiveness, Determining Automorphisms of the Recursively Enumerable Sets

Cites Work

• Unnamed Item
• On some games which are relevant to the theory of recursively enumerable sets
• The elementary theory of recursively enumerable sets
• Three theorems on the degrees of recursively enumerable sets
• The recursively enumerable degrees are dense
• A maximal set which is not complete
• Automorphisms of the lattice of recursively enumerable sets. I: Maximal sets
• On the Lattice of Recursively Enumerable Sets
• Degrees of Unsolvability. (AM-55)
• Classes of Recursively Enumerable Sets and Degrees of Unsolvability
• Degrees of recursively enumerable sets which have no maximal supersets
• Some theorems on R-maximal sets and major subsets of recursively enumerable sets
• Recursive Enumerability and the Jump Operator
• Recursively enumerable sets of positive integers and their decision problems