On Splits of Computably Enumerable Sets

DOI10.1007/978-3-319-50062-1_31zbMath1477.03162arXiv1605.03034OpenAlexW2963763495MaRDI QIDQ2970977

Peter A. Cholak

Publication date: 4 April 2017

Published in: Computability and Complexity (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1605.03034

Mathematics Subject Classification ID

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

Cites Work

• Automorphisms of the lattice of recursively enumerable sets: Orbits
• Some orbits for \({\mathcal E}\)
• -MAXIMAL SETS
• Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
• Diagonals and semihyperhypersimple sets
• Diagonals and -maximal sets
• Friedberg splittings in Σ₃⁰ quotient lattices of
• Recursion, metarecursion, and inclusion

This page was built for publication: On Splits of Computably Enumerable Sets