Undecidability and initial segments of the (r.e.) tt-degrees
From MaRDI portal
Publication:5202181
Recommendations
Cites work
- scientific article; zbMATH DE number 3861137 (Why is no real title available?)
- scientific article; zbMATH DE number 4091484 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- Distributive Initial Segments of the Degrees of Unsolvability
- First-order theory of the degrees of recursive unsolvability
- Initial Segments of Many-One Degrees
- Initial segments of one-one degrees
- Initial segments of the degrees of unsolvability
- Lattice-theoretic decision problems in universal algebra
- On degrees of recursive unsolvability
- Recursion theory week. Proceedings of a Conference held in Oberwolfach, West Germany, April 15-21, 1984
- Reducibility orderings: Theories, definability and automorphisms
- Strong reducibilities
- The computable enumerations of families of general recursive functions
- The undecidability of the recursively enumerable degrees
- The upper semi-lattice of degrees of recursive unsolvability
Cited in
(9)- scientific article; zbMATH DE number 15488 (Why is no real title available?)
- scientific article; zbMATH DE number 761273 (Why is no real title available?)
- Lattice initial segments of the hyperdegrees
- Minimal weak truth table degrees and computably enumerable Turing degrees
- scientific article; zbMATH DE number 3954890 (Why is no real title available?)
- Undecidable fragments of elementary theories
- Initial segments of Δ2n+11-degrees
- Initial segments of the degrees of size \(\aleph _ 1\)
- Interpreting true arithmetic in the theory of the r.e. truth table degrees
This page was built for publication: Undecidability and initial segments of the (r.e.) tt-degrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5202181)