Bounded recursively enumerable sets and degrees

DOI10.1007/BF02939527zbMATH Open0807.03027MaRDI QIDQ1338024FDOQ1338024

Yuefei Sui

Publication date: 17 November 1994

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

zbMATH Keywords

polynomial reducibilityNP-problembounded recursively enumerable setsreducibility 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

• Title not available (Why is that?)
• On the complexity of models of arithmetic
• Bounded existential induction
• Some problem in elementary arithmetics

Cited In (7)

• Cupping the Recursively Enumerable Degrees by D.R.E. Degrees
• On the theory of the PTIME degrees of the recursive sets
• Cappable recursively enumerable degrees and Post's program
• Minimal Degrees and Recursively Inseparable Pairs of Recursively Enumerable Sets
• Bounding minimal degrees by computably enumerable degrees
• Title not available (Why is that?)
• Bounded enumeration reducibility and its degree structure

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)