A note on partial numberings

DOI10.1002/MALQ.200310131MaRDI QIDQ4666942zbMATH OpenOpenAlexFDO

Authors Serikzhan A. Badaev, Dieter Spreen

Publication date 7 April 2005

Published in MLQ (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/malq.200310131

zbMATH Keywords

computable numberings of effective topological spacesFriedberg numberingpartial numberingRogers semilatticetotal numbering

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45)

Recommendations

• Strong reducibility of partial numberings
• Computable numberings of families of infinite sets
• Friedberg numberings of families of partial computable functionals
• Partial numberings and precompleteness
• scientific article; zbMATH DE number 6423750

Cites work

• Theorie der Numerierungen I

Cited in

(14)

• Partial degrees and \(r\)-degrees
• Strong reducibility of partial numberings
• Precomplete numberings
• Partial combinatory algebra and generalized numberings
• Reductions between types of numberings
• Some independence results for control structures in complete numberings
• Can partial indexings be totalized?
• scientific article; zbMATH DE number 6389656 (Why is no real title available?)
• Some remarks on completions of numberings
• Distributive lattices of numberings
• A note on direct sums of Friedbergnumberings
• Partial numberings and precompleteness
• scientific article; zbMATH DE number 6423750 (Why is no real title available?)
• How much partiality is needed for a theory of computability?

This page was built for publication: A note on partial numberings

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