106 results on '"Gherardi, Guido"'
Search Results
2. Non-Normal Super-Strict Implications
3. Completion of Choice
4. Weihrauch goes Brouwerian
5. Interpolation in extensions of first-order logic
6. Projection operators in the Weihrauch lattice
7. The basis of Boole's logical calculus
8. Weihrauch Complexity in Computable Analysis
9. Weihrauch Complexity in Computable Analysis
10. Interpolation in Extensions of First-Order Logic
11. The Vitali Covering Theorem in the Weihrauch Lattice
12. Probabilistic Computability and Choice
13. The Bolzano-Weierstrass Theorem is the Jump of Weak K\'onig's Lemma
14. Effective Choice and Boundedness Principles in Computable Analysis
15. Weihrauch Degrees, Omniscience Principles and Weak Computability
16. How incomputable is the separable Hahn-Banach theorem?
17. The Vitali Covering Theorem in the Weihrauch Lattice
18. Proof Systems for Super- Strict Implication
19. Probabilistic computability and choice
20. Computability and Incomputability of Differential Equations
21. Borel Complexity of Topological Operations on Computable Metric Spaces
22. Internal Computability
23. The Vitali Covering Theorem in the Weihrauch Lattice
24. An Analysis of the Lemmas of Urysohn and Urysohn-Tietze According to Effective Borel Measurability
25. The Bolzano–Weierstrass Theorem is the jump of Weak Kőnig’s Lemma
26. Non-Normal Super-Strict Implications
27. ALAN TURING AND THE FOUNDATIONS OF COMPUTABLE ANALYSIS
28. WEIHRAUCH DEGREES, OMNISCIENCE PRINCIPLES AND WEAK COMPUTABILITY
29. EFFECTIVE CHOICE AND BOUNDEDNESS PRINCIPLES IN COMPUTABLE ANALYSIS
30. Completion of choice
31. Super-Strict Implications
32. WEIHRAUCH GOES BROUWERIAN
33. Projection operators in the Weihrauch lattice
34. Interpolation in Extensions of First-Order Logic
35. Interpolation Theorem for First-Order Theories
36. Addendum to: “The Bolzano–Weierstrass theorem is the jump of weak Kőnig's lemma” [Ann. Pure Appl. Logic 163 (6) (2012) 623–655]
37. Las Vegas computability and algorithmic randomness
38. Las Vegas Computability and Algorithmic Randomness
39. Paradigmi di computazione per i numeri reali
40. Computability and Incomputability of Differential Equations
41. Effective Choice and Boundedness Principles in Computable Analysis
42. Weihrauch Degrees, Omniscience Principles and Weak Computability
43. How Incomputable Is the Separable Hahn-Banach Theorem?
44. How Incomputable is the Separable Hahn-Banach Theorem?
45. Effective Borel degrees of some topological functions
46. Borel Complexity of Topological Operations on Computable Metric Spaces.
47. Internal Computability.
48. An Analysis of the Lemmas of Urysohn and Urysohn-Tietze According to Effective Borel Measurability.
49. Borel Complexity of Topological Operations on Computable Metric Spaces.
50. Assioma di scelta, forcing e misura di Lebesgue
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.