The following pages link to (Q5518362):
Displaying 10 items.
- Domain representability of metric spaces (Q674414) (← links)
- Noncomputability in analysis and physics: A complete determination of the class of noncomputable linear operators (Q1054723) (← links)
- On effectively computable realizations of choice functions (Q1072545) (← links)
- Lower bounds on degrees of game-theoretic structures (Q1106754) (← links)
- On Turing degrees of Walrasian models and a general impossibility result in the theory of decision-making (Q1196206) (← links)
- Point-free topological spaces, functions and recursive points; filter foundation for recursive analysis. I (Q1295392) (← links)
- The eigenvalues of an effectively determined self-adjoint operator are computable, but the sequence of eigenvalues is not (Q1821332) (← links)
- Computable preference and utility (Q1961959) (← links)
- Stability of representations of effective partial algebras (Q2996232) (← links)
- Stability for Effective Algebras (Q4918000) (← links)
