scientific article; zbMATH DE number 4132145

zbMATH Open0692.03029MaRDI QIDQ3033754FDOQ3033754

Authors: V. P. Dobritsa 

Publication date: 1988

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

constructive modelbounded reducibilitiesindexations

Mathematics Subject Classification ID

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

Cited In (8)

• Title not available (Why is that?)
• Bounded theories for polyspace computability
• On notions of computability-theoretic reduction between Π21 principles
• On Nondeterminism, Enumeration Reducibility and Polynomial Bounds
• Bounded reducibility for computable numberings
• Title not available (Why is that?)
• Lattice embeddings for abstract bounded reducibilities
• 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)