Pages that link to "Item:Q2970965"
From MaRDI portal
The following pages link to Enumeration Reducibility and Computable Structure Theory (Q2970965):
Displaying 11 items.
- Computable fields and the bounded Turing reduction (Q408170) (← links)
- Bounded enumeration reducibility and its degree structure (Q661285) (← links)
- Computably enumerable sets and quasi-reducibility (Q1295419) (← links)
- Positive enumerable functors (Q2117801) (← links)
- \(Q\)-reducibility and \(m\)-reducibility on computably enumerable sets (Q2352682) (← links)
- On functors enumerating structures (Q2403649) (← links)
- (Q3487329) (← links)
- On Nondeterminism, Enumeration Reducibility and Polynomial Bounds (Q4351919) (← links)
- Computability-Theoretic Complexity of Countable Structures (Q4432545) (← links)
- On \(p\)-reducibility of computable numerations (Q5951067) (← links)
- COMPUTABLE REDUCIBILITY OF EQUIVALENCE RELATIONS AND AN EFFECTIVE JUMP OPERATOR (Q6103452) (← links)