Completeness in the arithmetical hierarchy and fixed points

DOI10.1007/BF01980603zbMATH Open0692.03030OpenAlexW1979697886MaRDI QIDQ583200FDOQ583200

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

• Title not available (Why is that?)
• The recursively enumerable degrees are dense
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Definable structures in the lattice of recursively enumerable sets
• Title not available (Why is that?)
• Rice Theorems For D.R.E. Sets
• Title not available (Why is that?)
• On the Degrees of Index Sets
• Title not available (Why is that?)

Cited In (8)

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

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)