Pages that link to "Item:Q751819"

The following pages link to On the theory of the PTIME degrees of the recursive sets (Q751819):

Displaying 10 items.

• A characterization of the leaf language classes (Q287160) (← links)
• Differences between resource bounded degree structures (Q558725) (← links)
• Automorphisms in the PTIME-Turing degrees of recursive sets (Q676317) (← links)
• Nondiamond theorems for polynomial time reducibility (Q1201882) (← links)
• Uniformly hard languages. (Q1874273) (← links)
• The Role of True Finiteness in the Admissible Recursively Enumerable Degrees (Q3370614) (← links)
• Exact Pairs for Abstract Bounded Reducibilities (Q4264535) (← links)
• Effectively dense Boolean algebras and their applications (Q4505908) (← links)
• The theory of the polynomial many-one degrees of recursive sets is undecidable (Q5096783) (← links)
• THE THEORY OF THE METARECURSIVELY ENUMERABLE DEGREES (Q5485749) (← links)