Partial numberings and precompleteness

MaRDI QIDQ4982355zbMATH OpenFDO

Authors Dieter Spreen

Publication date 9 April 2015

zbMATH Keywords

fixed point propertypartial numberingprecompleteness

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45)

Recommendations

• Alternative Characterizations of Precomplete Numerations
• Fixed point theorems for precomplete numberings
• A note on partial numberings
• Some remarks on completions of numberings
• Strong reducibility of partial numberings

Cited in

(12)

• Precomplete numberings
• Semilattices of punctual numberings
• Partial combinatory algebra and generalized numberings
• Fixed point theorems for precomplete numberings
• Some independence results for control structures in complete numberings
• scientific article; zbMATH DE number 6389656 (Why is no real title available?)
• Some remarks on completions of numberings
• Alternative Characterizations of Precomplete Numerations
• A note on partial numberings
• Fixpoints and relative precompleteness
• Numberings, c.e. oracles, and fixed points
• How much partiality is needed for a theory of computability?

This page was built for publication: Partial numberings and precompleteness

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