Pages that link to "Item:Q1193873"

The following pages link to The p-T-degrees of the recursive sets: Lattice embeddings, extensions of embeddings and the two-quantifier theory (Q1193873):

Displaying 9 items.

• Differences between resource bounded degree structures (Q558725) (← links)
• Strong polynomial-time reducibility (Q676314) (← links)
• Nondiamond theorems for polynomial time reducibility (Q1201882) (← links)
• Lattice representations for computability theory (Q1295402) (← links)
• On \(\Pi_ 2\) theories of \(hp-T\) degrees of low sets (Q1314385) (← links)
• On the lattices of NP-subspaces of a polynomial time vector space over a finite field (Q1923577) (← links)
• On MODkP Counting Degrees (Q4264534) (← links)
• The theory of the polynomial many-one degrees of recursive sets is undecidable (Q5096783) (← links)
• Decidability of the two-quantifier theory of the recursively enumerable weak truth-table degrees and other distributive upper semi-lattices (Q5687321) (← links)