Recursive Enumerability and the Jump Operator
From MaRDI portal
Cites work
- A criterion for completeness of degrees of unsolvability
- scientific article; zbMATH DE number 3117565 (Why is no real title available?)
- scientific article; zbMATH DE number 3073037 (Why is no real title available?)
- On degrees of recursive unsolvability
- On degrees of unsolvability
- The upper semi-lattice of degrees of recursive unsolvability
- TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
Cited in
(20)- Elementary differences among jump classes
- A non-inversion theorem for the jump operator
- r-maximal major subsets
- \(\Sigma_2\)-constructions and \(\text{I}\Sigma_1\)
- On the jumps of the degrees below a recursively enumerable degree
- Completely mitotic c.e. degrees and non-jump inversion
- On the Turing degrees of minimal index sets
- A bounded jump for the bounded Turing degrees
- Limits on jump inversion for strong reducibilities
- Inverting the Half-Jump
- Coding true arithmetic in the Medvedev degrees of ^0_1 classes
- Recursively enumerable sets and degrees
- Automorphisms of the lattice of recursively enumerable sets
- The ∀∃-theory of ℛ(≤,∨,∧) is undecidable
- The nonlow computably enumerable degrees are not invariant in \(\mathcal{E}\)
- IN MEMORIAM: GERALD E. SACKS, 1933–2019
- An incomplete set of shortest descriptions
- Infima in the d.r.e. degrees
- Generically computable linear orderings
- Weak jumps in the elementary degrees and jump inversion theorems
This page was built for publication: Recursive Enumerability and the Jump Operator
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5729295)
