scientific article; zbMATH DE number 4132145

MaRDI QIDQ3033754zbMATH OpenFDO

Authors V. P. Dobritsa

Publication date 1988

zbMATH Keywords

bounded reducibilitiesconstructive modelindexations

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Other degrees and reducibilities in computability and recursion theory (03D30) Theory of numerations, effectively presented structures (03D45)

Recommendations

• scientific article; zbMATH DE number 4101163
• Bounded reducibility for computable numberings
• scientific article; zbMATH DE number 4053597
• Lattice embeddings for abstract bounded reducibilities
• Publication:3491531

Cited in

(8)

• Bounded reducibility for computable numberings
• Bounded theories for polyspace computability
• Lattice embeddings for abstract bounded reducibilities
• On notions of computability-theoretic reduction between Π21 principles
• scientific article; zbMATH DE number 4164818 (Why is no real title available?)
• On Nondeterminism, Enumeration Reducibility and Polynomial Bounds
• scientific article; zbMATH DE number 1747699 (Why is no real title available?)
• On \(p\)-reducibility of computable numerations

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