Pages that link to "Item:Q1229713"

The following pages link to On the density of honest subrecursive classes (Q1229713):

Displaying 12 items.

• Streamlined subrecursive degree theory (Q408165) (← links)
• Honest elementary degrees and degrees of relative provability without the cupping property (Q515565) (← links)
• Cook reducibility is faster than Karp reducibility in NP (Q751812) (← links)
• Finite complete rewriting systems and the complexity of word problem (Q791314) (← links)
• Reductions among polynomial isomorphism types (Q1077412) (← links)
• Indexings of subrecursive classes (Q1140080) (← links)
• A maximal sequence of classes transformable by primitive recursion in a given class (Q1147129) (← links)
• Augmented loop languages and classes of computable functions (Q1219687) (← links)
• Polynomial and abstract subrecursive classes (Q1227276) (← links)
• Subrekursive Komplexität bei Gruppen. II: Der Einbettungssatz von Higman für entscheidbare Gruppen (Q1243275) (← links)
• The structure of the honest polynomial m-degrees (Q1341316) (← links)
• Semi-honest subrecursive degrees and the collection rule in arithmetic (Q6137350) (← links)