Completeness in the arithmetical hierarchy and fixed points

DOI10.1007/BF01980603zbMath0692.03030OpenAlexW1979697886MaRDI QIDQ583200

Marat 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)

Related Items (3)

Completeness criteria for a class of reducibilities ⋮ Things that can be made into themselves ⋮ Fixed-point selection functions

Cites Work

• The recursively enumerable degrees are dense
• Definable structures in the lattice of recursively enumerable sets
• Rice Theorems For D.R.E. Sets
• On the Degrees of Index Sets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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