Isomorphisms of splits of computably enumerable sets

DOI10.2178/jsl/1058448453zbMath1060.03066OpenAlexW2105517810MaRDI QIDQ4650269

Peter A. Cholak

Publication date: 9 February 2005

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.jsl/1058448453

zbMATH Keywords

automorphismcomputably enumerable set\(\Delta_0^3\)c.e.~degreer.e.~degree

Mathematics Subject Classification ID

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

Related Items (4)

The Complexity of Orbits of Computably Enumerable Sets ⋮ Computably enumerable sets and related issues ⋮ Extension theorems, orbits, and automorphisms of the computably enumerable sets ⋮ On the orbits of computably enumerable sets

Cites Work

• Friedberg splittings of recursively enumerable sets
• Coding in the partial order of enumerable sets
• Universal recursion theoretic properties of r.e. preordered structures
• On the orbits of hyperhypersimple sets
• Automorphisms of the lattice of recursively enumerable sets
• Intervals of the Lattice of Computably Enumerable Sets and Effective Boolean Algebras
• Effectively dense Boolean algebras and their applications
• Definable Encodings in the Computably Enumerable Sets
• Extension theorems, orbits, and automorphisms of the computably enumerable sets
• The Δ₃⁰-automorphism method and noninvariant classes of degrees

This page was built for publication: Isomorphisms of splits of computably enumerable sets