The last question on recursively enumerable m-degrees
From MaRDI portal
Publication:1908450
DOI10.1007/BF00739571zbMATH Open0846.03017OpenAlexW2034985264MaRDI QIDQ1908450FDOQ1908450
Publication date: 19 March 1996
Published in: Algebra and Logic (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/187699
Recursively (computably) enumerable sets and degrees (03D25) First-order arithmetic and fragments (03F30) Complexity of computation (including implicit computational complexity) (03D15) Models of arithmetic and set theory (03C62)
Cites Work
- Classical recursion theory. The theory of functions and sets of natural numbers
- The Theory of the Degrees below 0 ′
- The undecidability of the recursively enumerable degrees
- The theory of the recursively enumerable weak truth-table degrees is undecidable
- The computable enumerations of families of general recursive functions
- Undecidable fragments of elementary theories
- Model theory of the computably enumerable many-one degrees
- Interpreting true arithmetic in the theory of the r.e. truth table degrees
Cited In (11)
- Interpreting true arithmetic in the local structure of the enumeration degrees
- Title not available (Why is that?)
- Elementary theories and hereditary undecidability for semilattices of numberings
- Coding in the partial order of enumerable sets
- Title not available (Why is that?)
- Computably enumerable sets and related issues
- Effectively dense Boolean algebras and their applications
- Title not available (Why is that?)
- Model theory of the computably enumerable many-one degrees
- Interpreting true arithmetic in the theory of the r.e. truth table degrees
- The theory of ceers computes true arithmetic
Recommendations
This page was built for publication: The last question on recursively enumerable \(m\)-degrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1908450)
