Completeness in the arithmetical hierarchy and fixed points

DOI10.1007/BF01980603MaRDI QIDQ583200zbMATH OpenOpenAlexFDO

Authors M. M. Arslanov

Publication date 1989

Published in Algebra and Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01980603

zbMATH Keywords

\(\Sigma_ m\)-completeness criteria for \(\Sigma_ n\)-setsindex sets of n-recursively enumerable sets

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Hierarchies of computability and definability (03D55)

Cites work

• scientific article; zbMATH DE number 3825781 (Why is no real title available?)
• scientific article; zbMATH DE number 4057497 (Why is no real title available?)
• scientific article; zbMATH DE number 4091484 (Why is no real title available?)
• scientific article; zbMATH DE number 3639607 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• scientific article; zbMATH DE number 3342830 (Why is no real title available?)
• scientific article; zbMATH DE number 3342831 (Why is no real title available?)
• Definable structures in the lattice of recursively enumerable sets
• On the Degrees of Index Sets
• Rice Theorems For D.R.E. Sets
• The recursively enumerable degrees are dense

Cited in

(8)

• On completeness in a non-Archimedean setting, via firm reflections
• On the Completeness of the Totitives of a Natural Number
• Completeness criteria for a class of reducibilities
• Things that can be made into themselves
• Fixed-point selection functions
• The completeness of arithmetic sets under operations of set theory
• Marat Mirzaevich Arslanov (on his eightieth birthday)
• A complete theory with arbitrarily large minimality ranks

This page was built for publication: Completeness in the arithmetical hierarchy and fixed points

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q583200)