The following pages link to (Q3338243):
Displaying 12 items.
- A weak countable choice principle (Q4490238) (← links)
- Numerical theorem proving by electronic computers and its application in various branches of mathematics (Q4743763) (← links)
- 1994 Annual Meeting of the Association for Symbolic Logic (Q4837677) (← links)
- Solving the Dirichlet problem constructively (Q4907840) (← links)
- Singular Coverings and Non-Uniform Notions of Closed Set Computability (Q4918031) (← links)
- Bishop-Style Constructive Reverse Mathematics (Q5024576) (← links)
- Intersection points of planar curves can be computed (Q5075517) (← links)
- Annual Meeting of the Association for Symbolic Logic, Durham, 1992 (Q5287697) (← links)
- Algorithmic questions for real functions (Q5750410) (← links)
- The weak-operator sequential continuity of left multiplication (Q5935883) (← links)
- Wormholes, superfast computations, and Selivanov's theorem (Q6561174) (← links)
- Computably and punctually universal spaces (Q6614035) (← links)
