scientific article; zbMATH DE number 3926899
From MaRDI portal
Publication:3701411
[For the entire collection see Zbl 0553.00001.] In this survey paper some facts are discussed which are true for D (semilattice of Turing degrees) and for D(\(\geq f)\). But not every property established for D is true for D(\(\geq f)\) for every f. If D(\(\geq f)\cong D(\geq g)\) then \(f\leq g^{(n)}\) and \(g\leq f^{(n)}\) for some n. If \(Th(D(\geq f))=Th(D)\) then f is arithmetic.
Recommendations
- scientific article; zbMATH DE number 3914306
- scientific article; zbMATH DE number 3857081
- Degrees of unsolvability: a tutorial
- scientific article; zbMATH DE number 4081537
- scientific article; zbMATH DE number 4083606
- Degrees of unsolvability of continuous functions
- Degree of unsolvability of the completeness problem in algebras of recursive functions
- Some fundamental issues concerning degrees of unsolvability
- scientific article; zbMATH DE number 833149
Cited in
(3)
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 Q3701411)