Pages that link to "Item:Q4041560"
From MaRDI portal
The following pages link to The honest subrecursive classes are a lattice (Q4041560):
Displaying 12 items.
- Streamlined subrecursive degree theory (Q408165) (← links)
- Honest elementary degrees and degrees of relative provability without the cupping property (Q515565) (← links)
- Some undecidability results for non-monadic Church-Rosser Thue systems (Q1057264) (← links)
- Pseudo-natural algorithms for the word problem for finitely presented monoids and groups (Q1074716) (← links)
- Reductions among polynomial isomorphism types (Q1077412) (← links)
- A maximal sequence of classes transformable by primitive recursion in a given class (Q1147129) (← links)
- On the structure of sets in NP and other complexity classes (Q1162811) (← links)
- Augmented loop languages and classes of computable functions (Q1219687) (← links)
- Polynomial and abstract subrecursive classes (Q1227276) (← links)
- Minimal pairs of polynomial degrees with subexponential complexity (Q1228203) (← links)
- On the density of honest subrecursive classes (Q1229713) (← links)
- Semi-honest subrecursive degrees and the collection rule in arithmetic (Q6137350) (← links)
