Pages that link to "Item:Q6095972"
From MaRDI portal
The following pages link to ON THE STRUCTURE OF COMPUTABLE REDUCIBILITY ON EQUIVALENCE RELATIONS OF NATURAL NUMBERS (Q6095972):
Displaying 10 items.
- Computational completeness of equations over sets of natural numbers (Q2252522) (← links)
- On the degree structure of equivalence relations under computable reducibility (Q2295742) (← links)
- On Σ<sup>1</sup> <sub>1</sub> equivalence relations over the natural numbers (Q3117786) (← links)
- On notions of computability-theoretic reduction between Π21 principles (Q3186057) (← links)
- (Q3487329) (← links)
- ON RELATIVE COMPLETE REDUCIBILITY (Q5108051) (← links)
- On \(p\)-reducibility of computable numerations (Q5951067) (← links)
- Representations versus numberings: On the relationship of two computability notions (Q5958133) (← links)
- COMPUTABLE REDUCIBILITY OF EQUIVALENCE RELATIONS AND AN EFFECTIVE JUMP OPERATOR (Q6103452) (← links)
- Logical specifications of effectively separable data models (Q6638449) (← links)