Automorphisms of the lattice of recursively enumerable sets

DOI10.1090/memo/0541zbMath0821.03019OpenAlexW2005402036MaRDI QIDQ4326223

Peter A. Cholak

Publication date: 11 April 1995

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

Full work available at URL: https://semanticscholar.org/paper/1e531b9b205674260f12c229a7e9d587b483869f

zbMATH Keywords

automorphismprincipal filterslattice of recursively enumerable setshigh extension theorems

Mathematics Subject Classification ID

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

Related Items (19)

Computably enumerable sets that are automorphic to low sets ⋮ Extending and interpreting Post's programme ⋮ Atomless \(r\)-maximal sets ⋮ On the Universal Splitting Property ⋮ Definable relations in Turing degree structures ⋮ ASYMPTOTIC DENSITY AND COMPUTABLY ENUMERABLE SETS ⋮ Isomorphisms of splits of computably enumerable sets ⋮ The nonlow computably enumerable degrees are not invariant in $\mathcal {E}$ ⋮ Extension theorems, orbits, and automorphisms of the computably enumerable sets ⋮ Automorphisms of the Lattice of Recursively Enumerable Sets: Promptly Simple Sets ⋮ Permutations and Presentations ⋮ Turing computability: structural theory ⋮ Invariance in ℰ* and ℰ_{Π} ⋮ The dense simple sets are orbit complete with respect to the simple sets ⋮ Definable properties of the computably enumerable sets ⋮ Some orbits for \({\mathcal E}\) ⋮ Orbits of computably enumerable sets: Low sets can avoid an upper cone ⋮ Splitting theorems in recursion theory ⋮ The translation theorem

This page was built for publication: Automorphisms of the lattice of recursively enumerable sets