scientific article; zbMATH DE number 3995652
Let A be a recursively enumerable set, \(A^ s\) be an enumeration of A. By definition, the modulus m is given by \(m(x)=\mu_ s[\forall y<x)(y\in A\leftrightarrow y\in A^ s)]\). Similarly, the modulus for differences A-B is defined. Theorem. There is a difference of r.e. sets A-B and some enumeration such that the modulus m does not majorize any set H with \(H\leq_ TA-B\) and \(H\in \Sigma_ n^{-1}\), \(n\in \omega.\) Theorem. Let A-B and C-D be differences, \(A-B<_ TC-D\), \((A-B)'\in \Delta^ 0_ 2\) and \(A-B\neq W_ x\) for all x. Then there is a difference M-N such that \(A-B<_ TM-N<_ TC-D\) and there is no x such that \(A-B\leq_ TW_ x\leq_ TM-N\).
- Ershov hierarchy and the T-jump
- What's the difference
- Difference sets and computability theory
- Interpolating d-r.e. and REA degrees between r.e. degrees
- An algorithm for enumerating difference sets
- scientific article; zbMATH DE number 4055732 (Why is no real title available?)
- scientific article; zbMATH DE number 4087649 (Why is no real title available?)
- scientific article; zbMATH DE number 4091487 (Why is no real title available?)
- Relative enumerability in the difference hierarchy
- Difference Sets and Recursion Theory
- scientific article; zbMATH DE number 1543034 (Why is no real title available?)
- Differences of Computably Enumerable Sets
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4723717)