Splitting properties and jump classes

DOI10.1007/BF02760850zbMath0469.03026MaRDI QIDQ1156791

Wolfgang Maass, Richard A. Shore, Michael Stob

Publication date: 1981

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

zbMATH Keywords

automorphismfilterlattice of recursively enumerable setspromptly simple setsupper semilattice of recursively enumerable degrees

Mathematics Subject Classification ID

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

Related Items

Structural interactions of the recursively enumerable T- and W-degrees, An Algebraic Decomposition of the Recursively Enumerable Degrees and the Coincidence of Several Degree Classes with the Promptly Simple Degrees, ON THE DEFINABILITY OF THE DOUBLE JUMP IN THE COMPUTABLY ENUMERABLE SETS, Characterization of Recursively Enumerable Sets with Supersets Effectively Isomorphic to all Recursively Enumerable Sets, Duality, non-standard elements, and dynamic properties of r.e. sets, Variations on promptly simple sets, A remark on the length problem, A jump class of noncappable degrees, The Quotient Semilattice of the Recursively Enumerable Degrees Modulo the Cappable Degrees, Cupping and noncapping in the r.e. weak truth table and turing degrees, Property of t-retraceability and automorphisms of the lattice of recursively enumerable sets, COARSE REDUCIBILITY AND ALGORITHMIC RANDOMNESS, Friedberg splittings of recursively enumerable sets, Codable sets and orbits of computably enumerable sets, Automorphisms of the Lattice of Recursively Enumerable Sets: Promptly Simple Sets, Definable properties of the computably enumerable sets, Splitting theorems in recursion theory, Definable Encodings in the Computably Enumerable Sets

Cites Work

• Unnamed Item
• d-simple sets, small sets, and degree classes
• \(r\)-maximal major subsets
• Automorphisms of the lattice of recursively enumerable sets. I: Maximal sets
• Automorphisms of the lattice of recursively enumerable sets. Part II: Low sets
• Recursively enumerable generic sets
• One hundred and two problems in mathematical logic
• The infinite injury priority method
• Degrees of classes of RE sets
• Recursively enumerable sets and degrees
• Lower Bounds for Pairs of Recursively Enumerable Degrees
• Degrees of recursively enumerable sets which have no maximal supersets