scientific article; zbMATH DE number 22854

zbMATH Open0739.03025MaRDI QIDQ3980682FDOQ3980682

Authors: V. K. Bulitko 

Publication date: 26 June 1992

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

Recommendations

• scientific article; zbMATH DE number 4087651
• scientific article; zbMATH DE number 1779426
• On existence of complete sets for bounded reducibilities
• The \(n\)-r.e. degrees: undecidability and \(\Sigma_1\) substructures
• A note on hereditarily Π10- and Σ10-complete sets of sentences

zbMATH Keywords

reducibilitycomplete setsr.e. set\(1/n\)-hereditary sets\(1/n\)-recursive sets

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Cited In (5)

• A note on hereditarily Π10- and Σ10-complete sets of sentences
• Title not available (Why is that?)
• ON WAYS OF CHARACTERIZING COMPLETE SETS
• On -hereditary Sets and Consequences of the Axiom of Choice
• Title not available (Why is that?)

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