Splitting properties and jump classes

DOI10.1007/BF02760850MaRDI QIDQ1156791zbMATH OpenFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• Automorphisms of the lattice of recursively enumerable sets. I: Maximal sets
• Automorphisms of the lattice of recursively enumerable sets. Part II: Low sets
• Degrees of classes of RE sets
• Degrees of recursively enumerable sets which have no maximal supersets
• Lower Bounds for Pairs of Recursively Enumerable Degrees
• One hundred and two problems in mathematical logic
• Recursively enumerable generic sets
• Recursively enumerable sets and degrees
• The infinite injury priority method
• \(r\)-maximal major subsets
• d-simple sets, small sets, and degree classes

Cited in

(18)

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

This page was built for publication: Splitting properties and jump classes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1156791)