Bounded recursively enumerable sets and degrees

DOI10.1007/BF02939527MaRDI QIDQ1338024zbMATH OpenFDO

Authors Yuefei Sui

Publication date 17 November 1994

Published in Journal of Computer Science and Technology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02939527

zbMATH Keywords

bounded recursively enumerable setsNP-problempolynomial reducibilityreducibility between recursive sets

Mathematics Subject Classification ID

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

Cites work

• Bounded existential induction
• scientific article; zbMATH DE number 4091484 (Why is no real title available?)
• On the complexity of models of arithmetic
• Some problem in elementary arithmetics

Cited in

(7)

• Cappable recursively enumerable degrees and Post's program
• scientific article; zbMATH DE number 5000253 (Why is no real title available?)
• Minimal Degrees and Recursively Inseparable Pairs of Recursively Enumerable Sets
• Bounding minimal degrees by computably enumerable degrees
• Cupping the Recursively Enumerable Degrees by D.R.E. Degrees
• Bounded enumeration reducibility and its degree structure
• On the theory of the PTIME degrees of the recursive sets

This page was built for publication: Bounded recursively enumerable sets and degrees

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