Splitting properties and jump classes

DOI10.1007/BF02760850zbMATH Open0469.03026MaRDI QIDQ1156791FDOQ1156791

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

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

Cited In (18)

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