• Brattka, Vasco and Gherardi, Guido and Hölzl, Rupert and Pauly, Arno, The Vitali Covering Theorem in the Weihrauch Lattice, in: Day, Adam and Fellows, Michael and Greenberg, Noam and Khoussainov, Bakhadyr and Melnikov, Alexander and Rosamond, Frances (eds.), Computability and Complexity: Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday, vol. 10010 of Lecture Notes in Computer Science, Springer, Cham, 2017, pages 188-200
  • Gherardi, Guido, Teoremi dell'analisi e gradi di incomputabilità, in: Ballo, Edoardo and Cellucci, Carlo (eds.), La ricerca logica in Italia. Studi in onore di Corrado Mangione, Cisalpino Editore, 2011, pages 357-378
  • Gherardi, Guido, Computability and incomputability of differential equations, in: Corsi, Giovanna and Lupacchini, Rossella (eds.), Deduction, Computation, Experiment, Springer Verlag, Milano, 2008, pages 223-242

  • Brattka, Vasco and Gherardi, Guido and Hölzl, Rupert, Las Vegas Computability and Algorithmic Randomness, in: Mayr, Ernst W. and Ollinger, Nicolas (eds.), 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015), vol. 30 of Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl-Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2015, pages 130-142
  • Brattka, Vasco and Gherardi, Guido, Effective Choice and Boundedness Principles in Computable Analysis, in: Bauer, Andrej and Hertling, Peter and Ko, Ker-I (eds.), CCA 2009, Proceedings of the Sixth International Conference on Computability and Complexity in Analysis, Leibniz-Zentrum für Informatik, Schloss Dagstuhl, Germany, 2009, pages 95-106
  • Brattka, Vasco and Gherardi, Guido, Weihrauch Degrees, Omniscience Principles and Weak Computability, in: Bauer, Andrej and Hertling, Peter and Ko, Ker-I (eds.), CCA 2009, Proceedings of the Sixth International Conference on Computability and Complexity in Analysis, Leibniz-Zentrum für Informatik, Schloss Dagstuhl, Germany, 2009, pages 83-94
  • Gherardi, Guido and Marcone, Alberto, How Incomputable is the Separable Hahn-Banach Theorem?, in: Brattka, Vasco and Dillhage, Ruth and Grubba, Tanja and Klutsch, Angela (eds.), CCA 2008, Fifth International Conference on Computability and Complexity in Analysis, vol. 221 of Electronic Notes in Theoretical Computer Science, Elsevier, 2008, pages 85-102
  • Brattka, Vasco and Gherardi, Guido, Borel Complexity of Topological Operations on Computable Metric Spaces, in: Cooper, S. Barry and Löwe, Benedikt and Sorbi, Andrea (eds.), Computation and Logic in the Real World, vol. 4497 of Lecture Notes in Computer Science, Springer, Berlin, 2007, pages 83-97
  • Gherardi, Guido, Internal Computability, in: Cooper, S. Barry and Löwe, Benedikt and Sorbi, Andrea (eds.), Computation and Logic in the Real World, vol. 4497 of Lecture Notes in Computer Science, Springer, Berlin, 2007, pages 348-357
  • Gherardi, Guido, An Analysis of the Lemmas of Urysohn and Urysohn-Tietze According to Effective Borel Measurability, in: Beckmann, A. and Berger, U. and Löwe, B. and Tucker, J.V. (eds.), Logical Approaches to Computational Barriers, vol. 3988 of Lecture Notes in Computer Science, Springer, Berlin, 2006, pages 199-208

  • Gherardi, Guido, Some Results in Computable Analysis and Effective Borel Measurability, PhD thesis, University of Siena, Department of Mathematics and Computer Science, Siena, 2006
This publication list has currently 29 entries