scientific article; zbMATH DE number 2063214

MaRDI QIDQ4460829zbMATH OpenFDO

Authors Serikzhan A. Badaev, Andrea Sorbi, S. S. Goncharov

Publication date 29 March 2004

zbMATH Keywords

computable numberingelementary theoryRogers semilattice

Mathematics Subject Classification ID

Properties of classes of models (03C52) Theory of numerations, effectively presented structures (03D45)

Cited in

(8)

• Theories of Rogers semilattices of analytical numberings
• Precomplete numberings
• On universal pairs in the Ershov hierarchy
• Universal computable enumerations of finite classes of families of total functions
• Inductive inference and computable numberings
• On a Question of Frank Stephan
• Numberings, c.e. oracles, and fixed points
• Program self-reference in constructive Scott subdomains

This page was built for publication:

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