d-simple sets, small sets, and degree classes

DOI10.2140/pjm.1980.87.135zbMath0467.03040OpenAlexW2039559454MaRDI QIDQ1155608

Robert I. Soare, Manuel Lerman

Publication date: 1980

Published in: Pacific Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2140/pjm.1980.87.135

zbMATH Keywords

automorphisms of the lattice of recursively enumerable setssimplicity with respect to arrays of differences of recursively enumerable sets

Mathematics Subject Classification ID

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

Related Items (11)

Recursively enumerable generic sets ⋮ ON THE DEFINABILITY OF THE DOUBLE JUMP IN THE COMPUTABLY ENUMERABLE SETS ⋮ A Decidable Fragment of the Elementary Theory of the Lattice of Recursively Enumerable Sets ⋮ Splitting properties and jump classes ⋮ The Complexity of Orbits of Computably Enumerable Sets ⋮ Codable sets and orbits of computably enumerable sets ⋮ \(r\)-maximal major subsets ⋮ Recursively enumerable sets and degrees ⋮ Degree invariance in the Π₁⁰classes ⋮ Definable properties of the computably enumerable sets ⋮ Definable Encodings in the Computably Enumerable Sets

This page was built for publication: d-simple sets, small sets, and degree classes