Some reducibilities and splittings of recursively enumerable sets

DOI10.1007/BF02674875zbMath0955.03045OpenAlexW2113378332MaRDI QIDQ1972524

Roland Sh. Omanadze

Publication date: 2 August 2000

Published in: Mathematical Notes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02674875

zbMATH Keywords

reducibilitysplittingscomputably enumerable degreesuniversal splitting property

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Automorphisms of the lattice of recursively enumerable sets: Orbits
• Three theorems on the degrees of recursively enumerable sets
• Some results on bounded truth-table degrees
• The Degrees of R.E. Sets Without the Universal Splitting Property
• The universal splitting property. II
• T-Degrees, Jump Classes, and Strong Reducibilities
• Degree theoretical splitting properties of recursively enumerable sets
• On complexity properties of recursively enumerable sets
• Nowhere simple sets and the lattice of recursively enumerable sets
• Semirecursive Sets and Positive Reducibility
• A note on universal sets

This page was built for publication: Some reducibilities and splittings of recursively enumerable sets